

Solve the eight queens puzzle.



You can extend the problem to solve the puzzle with a board of size   NxN.

For the number of solutions for small values of   N,   see   OEIS: A000170.



Related tasks

 A* search algorithm
 Solve a Hidato puzzle
 Solve a Holy Knight's tour
 Knight's tour
 Peaceful chess queen armies
 Solve a Hopido puzzle
 Solve a Numbrix puzzle
 Solve the no connection puzzle


import Prelude;
 
public set[list[int]] Nqueens(int n){
	cols = upTill(n);
	result = {};
	for (vector <- permutations(cols)){
		if (n == size({vector[j] + j |j <- cols}) && n == size({vector[j] - j |j <- cols})) 
			result += vector;}
	return result;
}