[Information Index] [Generation Index] [COS homepage]

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 A000170(M1958) in Neil J. Sloane's database of integer sequences.

The algorithm used is well-known.

Relevant Links


Programs available:
[Information Index] [Generation Index] [COS homepage]

Questions?? Email The wizard of COS.
(Please note that the suffix XXXX must be removed from the preceeding email address.)
[Error Opening Counter File -- Click for more info]
It was last updated Monday, 23-May-2011 13:02:09 PDT.
©Frank Ruskey, 1995-2003.