public LinkedList<Board.Field> findSolution(int startX, int startY) {
		if( n > 4) {
			solveWithBacktrack(0,b.getField(startX, startY));
			
			
		} else {
			//special cases
			if(n == 1)
			{
				System.out.println(startX + " , " + startY);
			}
				
			
			//print nothing, there is no solution
		}
		
		Iterator<Board.Field> it = solution.descendingIterator();
		while(it.hasNext()) {
			Board.Field f = it.next();
			System.out.println(f.x + " , " + f.y);
		}
		
		return solution;
	}