Information on the n Queens problem

The problem is to find all ways of placing n non-taking queens on a n by n board. A queen attacks all cells in its same row, column, and either diagonal. Below we show a solution on a standard 8 by 8 board.

The number of solutions for n = 1,2,...,15, is 1, 0, 0, 2, 10, 4, 40, 92, 352, 724, 2680, 14200, 73712, 365596, 2279184. This is sequence Anum=A000170"> A000170(M1958) in

The algorithm used is well-known.

Relevant Links


Programs available:



It was last updated .