Can anyone possibly help me to get started on this. I'm still very much lost. I have done a ton of googling and have not turned up anything helpful.

Thanks.

GregBrannon, on 17 April 2012 - 01:36 PM, said:

We have not done anything with sets yet. All we were told was that this should be a fairly simple recursive method with the given pseudo-code. I'm just not seeing it or something. I feel kinda stupid because I have done more complicated things than this before. Yet I can't seem to wrap my head around it.

GregBrannon, on 17 April 2012 - 01:32 PM, said:

This is what I have done thus far, and a few other attempts but I know its completely wrong and it seems like I am just not understanding the pseudo-code correctly.

int[][] square = new int[3][3];
	ArrayList<Integer> used_nums = new ArrayList<Integer>();
	
	
	public MagicSquare()
	{
		rec_backtrack(0);
		print_square();
	}
	public void rec_backtrack(int level)
	{
		int step = 0;
		for(int i = 1; i < 10; i++)
		{
			if(!used_nums.contains(i))
			{
				square[step][level] = i;
				used_nums.add(i);
				step++;
			}
			if(step == 3) //we have inserted to all 3 spots now, check for solution
			{
				if((square[0][level] + square[1][level] + square[2][level]) == 15) //acceptable solution
				{
					rec_backtrack(level++);
				}
				else
				{
					step--;
				}
			}
		}
	}