View source for Eight queens puzzle

{{Short description|Mathematical problem set on a chessboard}}
{{Use dmy dates|date=January 2020}}
{{CS1 config|mode=cs1}}
{{Chess diagram
| tright
|
|__|__|__|__|__|ql|_|__
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|ql|__|__|__|__|__|__
|__|__|__|__|ql|__|__|__
|__|__|ql|__|__|__|__|__
|The only symmetrical solution to the eight queens puzzle ([[up to]] [[rotation]] and [[reflection (mathematics)|reflection]])
}}

The '''eight queens puzzle''' is the problem of placing eight [[chess]] [[Queen (chess)|queen]]s on an 8×8 [[chessboard]] so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal.  There are 92 solutions.  The problem was first posed in the mid-19th century.  In the modern era, it is often used as an example problem for various [[computer programming]] techniques.

The eight queens puzzle is a special case of the more general '''''n'' queens problem''' of placing ''n'' non-attacking queens on an ''n''×''n'' chessboard.  Solutions exist for all [[natural number]]s ''n'' with the exception of ''n'' = 2 and ''n'' = 3.  Although the exact number of solutions is only known for ''n'' ≤ 27, the [[asymptotic analysis|asymptotic growth rate]] of the number of solutions is approximately (0.143 ''n'')<sup>''n''</sup>.

==History==
[[Chess composer]] [[Max Bezzel]] published the eight queens puzzle in 1848. [[Franz Nauck]] published the first solutions in 1850.<ref name="rouse_ball_1960">[[W. W. Rouse Ball]] (1960) "The Eight Queens Problem", in ''Mathematical Recreations and Essays'', Macmillan, New York, pp. 165–171.</ref> Nauck also extended the puzzle to the ''n'' queens problem, with ''n'' queens on a chessboard of ''n''×''n'' squares.

Since then, many [[mathematician]]s, including [[Carl Friedrich Gauss]], have worked on both the eight queens puzzle and its generalized ''n''-queens version. In 1874, [[Siegmund Günther|S. Günther]] proposed a method using [[determinant]]s to find solutions.<ref name="rouse_ball_1960"/> [[James Whitbread Lee Glaisher|J.W.L. Glaisher]] refined Gunther's approach.

In 1972, [[Edsger Dijkstra]] used this problem to illustrate the power of what he called [[structured programming]]. He published a highly detailed description of a [[Depth-first search|depth-first]] [[Backtracking|backtracking algorithm]].<ref>[[Ole-Johan Dahl|O.-J. Dahl]], [[E. W. Dijkstra]], [[C. A. R. Hoare]] ''Structured Programming'', Academic Press, London, 1972 {{ISBN|0-12-200550-3}}, pp.&nbsp;72–82.</ref>

== Constructing and counting solutions when ''n'' = 8 ==
The problem of finding all solutions to the 8-queens problem can be quite computationally expensive, as there are 4,426,165,368 possible arrangements of eight queens on an 8×8 board,{{efn|The number of [[combination]]s of 8 squares from 64 is the [[binomial coefficient]] <sub>64</sub>C<sub>8</sub>.}} but only 92 solutions. It is possible to use shortcuts that reduce computational requirements or rules of thumb that avoids [[Brute-force search|brute-force computational techniques]]. For example, by applying a simple rule that chooses one queen from each column, it is possible to reduce the number of possibilities to 16,777,216 (that is, 8<sup>8</sup>) possible combinations. Generating [[permutation]]s further reduces the possibilities to just 40,320 (that is, [[factorial|8!]]), which can then be checked for diagonal attacks.

The eight queens puzzle has 92 distinct solutions. If solutions that differ only by the [[symmetry]] operations of rotation and reflection of the board are counted as one, the puzzle has 12 solutions.  These are called ''fundamental'' solutions; representatives of each are shown below.

A fundamental solution usually has eight variants (including its original form) obtained by rotating 90, 180, or 270° and then reflecting each of the four rotational variants in a mirror in a fixed position. However, one of the 12 fundamental solutions (solution 12 below) is identical to its own 180° rotation, so has only four variants (itself and its reflection, its 90° rotation and the reflection of that).{{efn|Other symmetries are possible for other values of ''n''.  For example, there is a placement of five nonattacking queens on a 5×5 board that is identical to its own 90° rotation. Such solutions have only two variants (itself and its reflection). If ''n'' > 1, it is not possible for a solution to be equal to its own reflection because that would require two queens to be facing each other.}}  Thus, the total number of distinct solutions is 11×8 + 1×4 = 92.

All fundamental solutions are presented below:

{{col-begin}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|ql|__|__|__|__|__|__
|__|__|__|__|ql|__|__|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|ql|__|__
|Solution 1
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|__|ql|__|__|__
|__|ql|__|__|__|__|__|__
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|__|__|ql|__|__
|ql|__|__|__|__|__|__|__
|Solution 2
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|ql|__|__|__|__
|__|ql|__|__|__|__|__|__
|__|__|__|__|__|__|ql|__
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|ql|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|__|ql|__|__|__
|ql|__|__|__|__|__|__|__
|Solution 3
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|ql|__|__
|__|__|__|__|__|__|__|ql
|__|__|ql|__|__|__|__|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|__|ql|__
|__|__|__|__|ql|__|__|__
|__|ql|__|__|__|__|__|__
|Solution 4
}}
{{col-end}}
{{col-begin}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|ql|__|__
|__|__|__|__|__|__|__|ql
|ql|__|__|__|__|__|__|__
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|__|__|__|__|ql|__|__|__
|__|ql|__|__|__|__|__|__
|Solution 5
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|__|ql|__|__|__
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|ql|__|__
|__|ql|__|__|__|__|__|__
|Solution 6
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|__|ql|__|__|__
|__|__|__|__|__|__|ql|__
|__|__|__|ql|__|__|__|__
|ql|__|__|__|__|__|__|__
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|__|__|ql|__|__
|__|ql|__|__|__|__|__|__
|Solution 7
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|ql|__|__|__|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|ql|__|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|__|__|ql|__|__
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|ql|__
|__|ql|__|__|__|__|__|__
|Solution 8
}}
{{col-end}}
{{col-begin}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|ql|__|__
|__|__|__|ql|__|__|__|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|__|ql|__|__|__
|__|__|__|__|__|__|ql|__
|__|ql|__|__|__|__|__|__
|Solution 9
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|__|__|ql|__|__
|__|ql|__|__|__|__|__|__
|__|__|__|__|__|__|ql|__
|ql|__|__|__|__|__|__|__
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|__|ql|__|__|__
|__|__|ql|__|__|__|__|__
|Solution 10
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|__|__|__|ql|__|__|__
|__|ql|__|__|__|__|__|__
|__|__|__|__|__|ql|__|__
|__|__|ql|__|__|__|__|__
|Solution 11
}}
{{col-break}}
{{Chess diagram small
| center
|
|__|__|__|__|__|ql|__|__
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|ql|__|__|__|__|__|__
|__|__|__|__|ql|__|__|__
|__|__|ql|__|__|__|__|__
|Solution 12
}}

{{col-end}}

Solution 10 has the additional property that [[No-three-in-line problem|no three queens are in a straight line]].

==Existence of solutions==

Brute-force algorithms to count the number of solutions are computationally manageable for {{math|1=''n''&nbsp;=&nbsp;8}}, but would be intractable for problems of {{math|1=''n''&nbsp;≥&nbsp;20}}, as 20! = 2.433 × 10<sup>18</sup>.  If the goal is to find a single solution, one can show solutions exist for all ''n'' ≥ 4 with no search whatsoever.<ref name=bernhardsson>{{cite journal |author=Bo Bernhardsson |date=1991 |title=Explicit Solutions to the N-Queens Problem for All N |journal=ACM SIGART Bulletin |volume=2 |issue=2 |pages=7 |doi=10.1145/122319.122322|s2cid=10644706 }}</ref><ref>{{Cite journal |last1=Hoffman |first1=E. J. |last2=Loessi |first2=J. C. |last3=Moore |first3=R. C. |date=1969-03-01 |title=Constructions for the Solution of the m Queens Problem |url=http://www.jstor.org/stable/2689192 |journal=Mathematics Magazine |language=en |volume=42 |issue=2 |pages=66 |doi=10.2307/2689192 |jstor=2689192 |url-access=subscription |archive-date=8 November 2016 |access-date=4 November 2024 |archive-url=https://web.archive.org/web/20161108102345/http://penguin.ewu.edu/~trolfe/QueenLasVegas/Hoffman.pdf |url-status=dead }}</ref>
These solutions exhibit stair-stepped patterns, as in the following examples for ''n'' = 8, 9 and 10:
{{col-begin-fixed}}
{{col-break}}
{{Chess diagram small
| tleft
|
|__|__|__|ql|__|__|__|__
|__|__|__|__|__|__|ql|__
|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|__|ql
|__|ql|__|__|__|__|__|__
|__|__|__|__|ql|__|__|__
|ql|__|__|__|__|__|__|__
|__|__|__|__|__|ql|__|__
| Staircase solution for 8 queens
}}
{{col-break}}
{{Chess diagram 9x9 small
| tleft
|
|__|__|__|__|__|__|ql|__|__
|__|__|ql|__|__|__|__|__|__
|__|__|__|__|__|ql|__|__|__
|__|ql|__|__|__|__|__|__|__
|__|__|__|__|ql|__|__|__|__
|ql|__|__|__|__|__|__|__|__
|__|__|__|__|__|__|__|__|ql
|__|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|__|ql|__
| Staircase solution for 9 queens
}}
{{col-break}}
{{Chess diagram 10x10 small
| tleft
|
|__|__|__|__|ql|__|__|__|__|__
|__|__|__|__|__|__|__|__|__|ql
|__|__|__|ql|__|__|__|__|__|__
|__|__|__|__|__|__|__|__|ql|__
|__|__|ql|__|__|__|__|__|__|__
|__|__|__|__|__|__|__|ql|__|__
|__|ql|__|__|__|__|__|__|__|__
|__|__|__|__|__|__|ql|__|__|__
|ql|__|__|__|__|__|__|__|__|__
|__|__|__|__|__|ql|__|__|__|__
| Staircase solution for 10 queens
}}
{{col-end}}

The examples above can be obtained with the following formulas.<ref name=bernhardsson /> Let (''i'', ''j'') be the square in column ''i'' and row ''j'' on the ''n'' × ''n'' chessboard, ''k'' an integer.

One approach<ref name=bernhardsson /> is

# If the remainder from dividing ''n'' by 6 is not 2 or 3 then the list is simply all even numbers followed by all odd numbers not greater than ''n''.
# Otherwise, write separate lists of even and odd numbers (2, 4, 6, 8 – 1, 3, 5, 7).
# If the remainder is 2, swap 1 and 3 in odd list and move 5 to the end ('''3, 1''', 7, '''5''').
# If the remainder is 3, move 2 to the end of even list and 1,3 to the end of odd list (4, 6, 8, '''2''' – 5, 7, 9, '''1, 3''').
# Append odd list to the even list and place queens in the rows given by these numbers, from left to right (a2, b4, c6, d8, e3, f1, g7, h5).

For {{math|1=''n''&nbsp;=&nbsp;8}} this results in fundamental solution 1 above. A few more examples follow.
* 14 queens (remainder 2): 2, 4, 6, 8, 10, 12, 14, 3, 1, 7, 9, 11, 13, 5.
* 15 queens (remainder 3): 4, 6, 8, 10, 12, 14, 2, 5, 7, 9, 11, 13, 15, 1, 3.
* 20 queens (remainder 2): 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 3, 1, 7, 9, 11, 13, 15, 17, 19, 5.

==Counting solutions for other sizes ''n''==
===Exact enumeration===
There is no known formula for the exact number of solutions for placing ''n'' queens on an {{math|''n'' × ''n''}} board i.e. the number of [[independent set (graph theory)|independent set]]s of size ''n'' in an {{math|''n'' × ''n''}} [[queen's graph]]. The 27×27 board is the highest-order board that has been completely enumerated.<ref>{{Cite web|url=https://github.com/preusser/q27|title=The Q27 Project|via=GitHub}}</ref>  The following tables give the number of solutions to the ''n'' queens problem, both fundamental {{OEIS|id=A002562}} and all {{OEIS|id=A000170}}, for all known cases.

{| class="wikitable" style="text-align:right;"
!style="padding: 0em .5em;"|''n''
|fundamental
|all
|-
!style="padding: 0em .5em;"|1
|1
|1
|-
!style="padding: 0em .5em;"|2
|0
|0
|-
!style="padding: 0em .5em;"|3
|0
|0
|-
!style="padding: 0em .5em;"|4
|1
|2
|-
!style="padding: 0em .5em;"|5
|2
|10
|-
!style="padding: 0em .5em;"|6
|1
|4
|-
!style="padding: 0em .5em;"|7
|6
|40
|-
!style="padding: 0em .5em;"|8
|12
|92
|-
!style="padding: 0em .5em;"|9
|46
|352
|-
!style="padding: 0em .5em;"|10
|92
|724
|-
!style="padding: 0em .5em;"|11
|341
|2,680
|-
!style="padding: 0em .5em;"|12
|1,787
|14,200
|-
!style="padding: 0em .5em;"|13
|9,233
|73,712
|-
!style="padding: 0em .5em;"|14
|45,752
|365,596
|-
!style="padding: 0em .5em;"|15
|285,053
|2,279,184
|-
!style="padding: 0em .5em;"|16
|1,846,955
|14,772,512
|-
!style="padding: 0em .5em;"|17
|11,977,939
|95,815,104
|-
!style="padding: 0em .5em;"|18
|83,263,591
|666,090,624
|-
!style="padding: 0em .5em;"|19
|621,012,754
|4,968,057,848
|-
!style="padding: 0em .5em;"|20
|4,878,666,808
|39,029,188,884
|-
!style="padding: 0em .5em;"|21
|39,333,324,973
|314,666,222,712
|-
!style="padding: 0em .5em;"|22
|336,376,244,042
|2,691,008,701,644
|-
!style="padding: 0em .5em;"|23
|3,029,242,658,210
|24,233,937,684,440
|-
!style="padding: 0em .5em;"|24
|28,439,272,956,934
|227,514,171,973,736
|-
!style="padding: 0em .5em;"|25
|275,986,683,743,434
|2,207,893,435,808,352
|-
!style="padding: 0em .5em;"|26
|2,789,712,466,510,289
|22,317,699,616,364,044
|-
!style="padding: 0em .5em;"|27
|29,363,495,934,315,694
|234,907,967,154,122,528
|}
The number of placements in which furthermore no three queens lie on any straight line is known for <math>n \leq 25</math> {{OEIS|id=A365437}}.

=== Asymptotic enumeration ===
In 2021, Michael Simkin proved that for large numbers ''n'', the number of solutions of the ''n'' queens problem is approximately <math>(0.143n)^n</math>.<ref>{{Cite web|last=Sloman|first=Leila|date=2021-09-21|title=Mathematician Answers Chess Problem About Attacking Queens|url=https://www.quantamagazine.org/mathematician-answers-chess-problem-about-attacking-queens-20210921/|access-date=2021-09-22|website=Quanta Magazine|language=en}}</ref>  More precisely, the number <math>\mathcal{Q}(n)</math> of solutions has [[asymptotic growth]]
<math display="block">
\mathcal{Q}(n) = ((1 \pm o(1))ne^{-\alpha})^n
</math>
where <math>\alpha</math> is a constant that lies between 1.939 and 1.945.<ref>{{Cite arXiv|last=Simkin|first=Michael|author-link=Michael Simkin|date=2021-07-28|title=The number of $n$-queens configurations|class=math.CO|eprint=2107.13460v2|language=en}}</ref> (Here ''o''(1) represents [[little o notation]].)

If one instead considers a [[flat torus|toroidal]] chessboard (where diagonals "wrap around" from the top edge to the bottom and from the left edge to the right), it is only possible to place ''n'' queens on an <math>n \times n</math> board if <math>n \equiv 1,5 \mod 6.</math>  In this case, the asymptotic number of solutions is<ref>{{Cite arXiv|last=Luria|first=Zur|date=2017-05-15|title=New bounds on the number of n-queens configurations|class=math.CO|eprint=1705.05225v2|language=en}}</ref><ref>{{Cite arXiv|last1=Bowtell|first1=Candida|last2=Keevash|first2=Peter|authorlink2 = Peter Keevash|date=2021-09-16|title=The $n$-queens problem|class=math.CO|eprint=2109.08083v1|language=en}}</ref>
<math display="block">T(n) = ((1+o(1))ne^{-3})^n.</math>

==Related problems==
;Higher dimensions
:Find the number of non-attacking queens that can be placed in a ''d''-dimensional chess {{boardgloss|gamespace|space}} of size ''n''.  More than ''n'' queens can be placed in some higher dimensions (the smallest example is four non-attacking queens in a 3×3×3 chess space), and it is in fact known that for any ''k'', there are higher dimensions where ''n''<sup>''k''</sup> queens do not suffice to attack all spaces.<ref>J. Barr and S. Rao (2006), The n-Queens Problem in Higher Dimensions, [[Elemente der Mathematik]], vol 61 (4), pp. 133–137.</ref><ref>{{cite web | url= http://queens.lyndenlea.info/beyond2d.php | title= Queens On A Chessboard – Beyond The 2nd Dimension | access-date=2020-01-27 | author= Martin S. Pearson | format= php | language= en}}</ref>
;Using pieces other than queens
:On an 8×8 board one can place 32 [[knight (chess)|knight]]s, or 14 [[bishop (chess)|bishop]]s, 16 [[king (chess)|king]]s or 8 [[rook (chess)|rook]]s, so that no two pieces attack each other. In the case of knights, an easy solution is to place one on each square of a given color, since they move only to the opposite color. The solution is also easy for rooks and kings. Sixteen kings can be placed on the board by dividing it into 2-by-2 squares and placing the kings at equivalent points on each square.  Placements of ''n'' rooks on an ''n''×''n'' board are in direct correspondence with order-''n'' [[permutation matrices]].
;Chess variations
:Related problems can be asked for [[chess variations]] such as [[shogi]]. For instance, the ''n''+''k'' dragon kings problem asks to place ''k'' [[Shogi#equipment|shogi pawns]] and ''n''+''k'' mutually nonattacking [[Shogi#equipment|dragon kings]] on an ''n''×''n'' shogi board.<ref>{{Cite journal|last=Chatham|first=Doug|date=1 December 2018|title=Reflections on the n +k dragon kings problem|journal=Recreational Mathematics Magazine|language=en|volume=5|issue=10|pages=39–55|doi=10.2478/rmm-2018-0007|doi-access=free}}</ref>
;Nonstandard boards
:[[George Pólya|Pólya]] studied the ''n'' queens problem on a [[torus|toroidal]] ("donut-shaped") board and showed that there is a solution on an ''n''×''n'' board if and only if ''n'' is not divisible by 2 or 3.<ref>G. Pólya, Uber die "doppelt-periodischen" Losungen des n-Damen-Problems, George Pólya:    Collected papers Vol. IV, G-C. Rota, ed., MIT Press, Cambridge, London, 1984, pp.&nbsp;237–247
</ref>
;Domination
:Given an ''n''×''n'' board, the '''domination number''' is the minimum number of queens (or other pieces) needed to attack or occupy every square. For ''n'' = 8 the queen's domination number is 5.<ref>{{citation|last1=Burger|first1=A. P.|last2=Cockayne|first2=E. J.|last3=Mynhardt|first3=C. M.|author3-link=Kieka Mynhardt|doi=10.1016/0012-365X(95)00327-S|issue=1–3|journal=Discrete Mathematics|mr=1428557|pages=47–66|title=Domination and irredundance in the queens' graph|volume=163|year=1997|hdl=1828/2670|hdl-access=free}}</ref><ref>{{citation|last=Weakley|first=William D.|editor1-last=Gera|editor1-first=Ralucca|editor1-link=Ralucca Gera|editor2-last=Haynes|editor2-first=Teresa W.|editor2-link=Teresa W. Haynes|editor3-last=Hedetniemi|editor3-first=Stephen T.|contribution=Queens around the world in twenty-five years|doi=10.1007/978-3-319-97686-0_5|location=Cham|mr=3889146|pages=43–54|publisher=Springer|series=Problem Books in Mathematics|title=Graph Theory: Favorite Conjectures and Open Problems – 2|year=2018|isbn=978-3-319-97684-6 }}</ref>
;Queens and other pieces
:Variants include mixing queens with other pieces; for example, placing ''m'' queens and ''m'' knights on an ''n''×''n'' board so that no piece attacks another<ref>{{Cite web |url=http://www.vector.org.uk/archive/v213/hui213.htm |title=Queens and knights problem |access-date=20 September 2005 |archive-url=https://web.archive.org/web/20051016004909/http://www.vector.org.uk/archive/v213/hui213.htm |archive-date=16 October 2005 |url-status=dead }}</ref> or placing queens and pawns so that no two queens attack each other.<ref>{{cite journal|last1=Bell |first1=Jordan |last2=Stevens |first2=Brett |title=A survey of known results and research areas for '''n'''-queens  |journal=Discrete Mathematics|volume=309 |number=1|year=2009|pages=1–31|doi=10.1016/j.disc.2007.12.043|doi-access=free}}</ref>
;[[Magic square]]s
:In 1992, Demirörs, Rafraf, and Tanik published a method for converting some magic squares into ''n''-queens solutions, and vice versa.<ref>O. Demirörs, N. Rafraf, and M.M. Tanik. Obtaining n-queens solutions from magic squares and constructing magic squares from n-queens solutions. Journal of Recreational Mathematics, 24:272–280, 1992</ref>
;[[Latin square]]s
:In an ''n''×''n'' matrix, place each digit 1 through ''n'' in ''n'' locations in the matrix so that no two instances of the same digit are in the same row or column.
;[[Exact cover]]
:Consider a matrix with one primary column for each of the ''n'' ranks of the board, one primary column for each of the ''n'' files, and one secondary column for each of the 4''n'' − 6 nontrivial diagonals of the board.  The matrix has ''n''<sup>2</sup> rows: one for each possible queen placement, and each row has a 1 in the columns corresponding to that square's rank, file, and diagonals and a 0 in all the other columns.  Then the ''n'' queens problem is equivalent to choosing a subset of the rows of this matrix such that every primary column has a 1 in precisely one of the chosen rows and every secondary column has a 1 in at most one of the chosen rows; this is an example of a generalized [[exact cover]] problem, of which [[sudoku]] is another example.
; ''n''-queens completion
:The completion problem asks whether, given an ''n''×''n'' chessboard on which some queens are already placed, it is possible to place a queen in every remaining row so that no two queens attack each other.  This and related questions are [[NP-complete]] and [[Sharp-P-complete|#P-complete]].<ref>{{cite journal
 | last1 = Gent
 | first1 = Ian P.
 | last2 = Jefferson
 | first2 = Christopher
 | last3 = Nightingale
 | first3 = Peter
 | title = Complexity of ''n''-Queens Completion
 | journal = [[Journal of Artificial Intelligence Research]]
 | volume = 59
 | pages = 815–848
 | date = August 2017
 | language = en
 | url = https://jair.org/index.php/jair/article/view/11079/26262
 | issn = 1076-9757
 | doi = 10.1613/jair.5512
 | access-date = 7 September 2017 | doi-access = free
 | hdl = 10023/11627
 | hdl-access = free
 }}</ref> Any placement of at most ''n''/60 queens can be completed, while there are partial configurations of roughly ''n''/4 queens that cannot be completed.<ref>{{cite journal |last1=Glock |first1=Stefan |last2=Correia |first2=David Munhá |last3=Sudakov |first3=Benny |title=The ''n''-queens completion problem |journal=Research in the Mathematical Sciences |date=6 July 2022 |volume=9 |issue=41 |page=41 |doi=10.1007/s40687-022-00335-1 |pmid=35815227 |pmc=9259550 |s2cid=244478527 |doi-access=free }}</ref>

==Exercise in algorithm design==
Finding all solutions to the eight queens puzzle is a good example of a simple but nontrivial problem. For this reason, it is often used as an example problem for various programming techniques, including nontraditional approaches such as [[constraint programming]], [[logic programming]] or [[genetic algorithm]]s. Most often, it is used as an example of a problem that can be solved with a [[recursion|recursive]] [[algorithm]], by phrasing the ''n'' queens problem inductively in terms of adding a single queen to any solution to the problem of placing ''n''−1 queens on an ''n''×''n'' chessboard. The [[mathematical induction|induction]] bottoms out with the solution to the 'problem' of placing 0 queens on the chessboard, which is the empty chessboard. This process can be made more efficient by applying the observation that each column of the chessboard must contain exactly one queen, and restricting the positions at which the algorithm tries adding the ''i''th queen to the ''i''th row of the chessboard, in columns that are not already attacked by other queens. These choices significantly reduce the number of placements that need to be tried, allowing the algorithm to find all solutions on an <math>8\times 8</math> chessboard in a time so short as to appear instantaneous.<ref>{{cite book
 | last = Uehara | first = Ryuhei
 | contribution = 5.1 The Eight Queen Puzzle
 | doi = 10.1007/978-981-13-3188-6
 | isbn = 9789811331886
 | pages = 111–118
 | publisher = Springer Singapore
 | title = First Course in Algorithms Through Puzzles
 | year = 2019}}</ref>

[[Image:Eight-queens-animation.gif|thumb|This animation illustrates [[backtracking]] to solve the problem. The ''i''th queen is placed in the ''i''th row of the chessboard, in a column that is known not to cause conflict. If a column is not found the program returns to the last good state and then tries a different column.]]

[[File:8queensminconflict.gif|thumbnail|right|[[Min-conflicts algorithm|min-conflicts]] solution to 8 queens]]
An alternative to exhaustive search is an 'iterative repair' algorithm, which typically starts with all queens on the board, for example with one queen per column.<ref>[http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4DC9292839FE7B1AFABA1EDB8183242C?doi=10.1.1.57.4685&rep=rep1&type=pdf A Polynomial Time Algorithm for the N-Queen Problem] by Rok Sosic and Jun Gu, 1990.  Describes run time for up to 500,000 Queens which was the max they could run due to memory constraints.</ref> It then counts the number of conflicts (attacks), and uses a heuristic to determine how to improve the placement of the queens. The '[[Min-conflicts algorithm|minimum-conflicts]]' [[heuristic]] – moving the piece with the largest number of conflicts to the square in the same column where the number of conflicts is smallest – is particularly effective: it easily finds a solution to even the 1,000,000 queens problem.<ref>{{Cite journal |last1=Minton |first1=Steven |last2=Johnston |first2=Mark D. |last3=Philips |first3=Andrew B. |last4=Laird |first4=Philip |date=1992-12-01 |title=Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems |url=https://dx.doi.org/10.1016/0004-3702%2892%2990007-K |journal=Artificial Intelligence |language=en |volume=58 |issue=1 |pages=161–205 |doi=10.1016/0004-3702(92)90007-K |s2cid=14830518 |issn=0004-3702|hdl=2060/19930006097 |hdl-access=free |url-access=subscription }}</ref><ref>{{Cite journal |last1=Sosic |first1=R. |last2=Gu |first2=Jun |date=October 1994 |title=Efficient local search with conflict minimization: a case study of the n-queens problem |journal=IEEE Transactions on Knowledge and Data Engineering |volume=6 |issue=5 |pages=661–668 |doi=10.1109/69.317698 |issn=1558-2191}}</ref>

Unlike the backtracking search outlined above, iterative repair does not guarantee a solution: like all [[greedy algorithm|greedy]] procedures, it may get stuck on a local optimum.  (In such a case, the algorithm may be restarted with a different initial configuration.) On the other hand, it can solve problem sizes that are several orders of magnitude beyond the scope of a depth-first search.

As an alternative to backtracking, solutions can be counted by recursively enumerating valid partial solutions, one row at a time. Rather than constructing entire board positions, blocked diagonals and columns are tracked with bitwise operations. This does not allow the recovery of individual solutions.<ref>{{cite journal|last1=Qiu|first1=Zongyan|title=Bit-vector encoding of n-queen problem|journal=ACM SIGPLAN Notices|date=February 2002|volume=37|issue=2|pages=68–70|doi=10.1145/568600.568613}}</ref><ref>{{cite tech report|first=Martin|last=Richards|title=Backtracking Algorithms in MCPL using Bit Patterns and Recursion|institution=University of Cambridge Computer Laboratory|number=UCAM-CL-TR-433|date=1997|url=http://www.cl.cam.ac.uk/~mr10/backtrk.pdf}}</ref>

==Sample program==
The following program is a translation of [[Niklaus Wirth]]'s solution into the [[Python (programming language)|Python]] programming language, but does without the [[Array data type|index arithmetic]] found in the original and instead uses [[List (abstract data type)|lists]] to keep the program code as simple as possible. By using a [[coroutine]] in the form of a [[Generator (computer programming)|generator function]], both versions of the original can be unified to compute either one or all of the solutions. Only 15,720 possible queen placements are examined.<ref>{{cite book|last=Wirth |first=Niklaus |author-link=Niklaus Wirth |title=Algorithms + Data Structures = Programs |series=Prentice-Hall Series in Automatic Computation |publisher=Prentice-Hall |year=1976 |isbn=978-0-13-022418-7 |title-link=Algorithms + Data Structures = Programs |bibcode=1976adsp.book.....W}} p. 145</ref><ref>{{cite book |last=Wirth |first=Niklaus |date=2012 |orig-date=orig. 2004 |title=Algorithms and Data Structures |version=Oberon version with corrections and authorized modifications |url=https://informatika-21.ru/ADen/AD2012.pdf |chapter=The Eight Queens Problem |pages=114–118}}</ref>
<syntaxhighlight lang="python">
def queens(n: int, i: int, a: list, b: list, c: list):
    if i < n:
        for j in range(n):
            if j not in a and i + j not in b and i - j not in c:
                yield from queens(n, i + 1, a + [j], b + [i + j], c + [i - j])
    else:
        yield a

for solution in queens(8, 0, [], [], []):
    print(solution)
</syntaxhighlight>The following program is an implementation of [[Donald Knuth]]'s informal description of the solution on Page 31, Section 7.2.2 ''Backtrack Programming'' from [[The Art of Computer Programming]], Volume 4B into the Python programming language.<ref>{{Cite book |last=Knuth |first=Donald Ervin |title=The art of computer programming. volume 4B part 2: Combinatorial algorithms |date=2023 |publisher=Addison-Wesley |isbn=978-0-201-03806-4 |location=Boston Munich}}</ref>
<syntaxhighlight lang="python3">
def property(perm: list) -> bool:
    for k in range(0, len(perm)):
        for j in range(0, len(perm)):
            if j < k:
                if perm[k] == perm[j]:
                    return False
                elif abs(perm[k] - perm[j]) == k - j:
                    return False
    return True

def extend(perm: list, n: int):
    new_perm = []
    for p in perm:
        for i in range(0, n):
            new_perm.append(p + [i])
    return new_perm

def n_queens(n: int) -> int:
    domain = list(range(0, n))
    perm = [[]]
    for i in range(n):
        new_perm = list(filter(property, extend(perm, n)))
        perm = new_perm
    return len(perm)
</syntaxhighlight>

==In popular culture==
* In the game ''[[The 7th Guest]]'', the 8th Puzzle: "The Queen's Dilemma" in the game room of the Stauf mansion is the [[de facto]] eight queens puzzle.<ref>{{cite book|url=http://www.thealmightyguru.com/Wiki/images/a/a7/7th_Guest%2C_The_-_Official_Strategy_Guide%2C_The.pdf |title=The 7th Guest: The Official Strategy Guide|first=Rusel|last=DeMaria|publisher=Prima Games|isbn=978-1-5595-8468-5|date=Nov 15, 1993|access-date=Apr 22, 2021}}</ref>{{rp|pages=48–49,289–290}}
* In the game ''[[Professor Layton and the Curious Village]]'', the 130th puzzle: "Too Many Queens 5" ({{lang|ja|クイーンの問題5}}) is an eight queens puzzle.<ref>{{cite web|url=https://layton-fushigi.g-takumi.com/nazo130.html |title=ナゾ130 クイーンの問題5|work=ゲームの匠|language=ja|access-date=September 17, 2021}}</ref>

==See also==
* [[Mathematical game]]
* [[Mathematical puzzle]]
* [[No-three-in-line problem]]
* [[Rook polynomial]]
* [[Costas array]]

==Notes==
{{notelist}}

==References==
{{Reflist}}

==Further reading==
* {{cite journal|last1=Bell |first1=Jordan |last2=Stevens |first2=Brett
  |title=A survey of known results and research areas for '''n'''-queens
   |journal=Discrete Mathematics|volume=309 |number=1|year=2009|pages=1–31|doi=10.1016/j.disc.2007.12.043|doi-access=free}}
* {{cite book|last1=Watkins|first1=John J.|year=2004|title=Across the Board: The Mathematics of Chess Problems|location=Princeton|publisher=Princeton University Press|isbn=978-0-691-11503-0|url-access=registration|url=https://archive.org/details/acrossboardma00watk}}
* {{cite web|url=http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Recn/Queens3D/
   |title=Three Dimensional NxN-Queens Problems|first1=L. |last1= Allison |first2=C.N. |last2= Yee
   |first3= M. |last3=McGaughey |year=1988|location=Department of Computer Science, Monash University, Australia}}
* {{cite journal|first1=S. |last1= Nudelman |title=The Modular N-Queens Problem in Higher Dimensions
   |journal=Discrete Mathematics|volume=146 |number=1–3|year=1995|pages=159–167|doi=10.1016/0012-365X(94)00161-5|doi-access=free}}
* {{cite journal|first1=M. |last1= Engelhardt |title=Der Stammbaum der Lösungen des Damenproblems (in German, means The pedigree chart of solutions to the 8-queens problem| journal=Spektrum der Wissenschaft |date=August 2010 |pages=68–71 |url=http://www.spektrum.de/artikel/1037434&_z=798888}}
* [http://www.liacs.nl/~kosters/nqueens/papers/gomez2004.pdf ''On The Modular N-Queen Problem in Higher Dimensions''], Ricardo Gomez, Juan Jose Montellano and Ricardo Strausz (2004), Instituto de Matematicas, Area de la Investigacion Cientifica, Circuito Exterior, Ciudad Universitaria, Mexico.
* {{cite book|last=Budd|first=Timothy|date=2002|title=An Introduction to Object-Oriented Programming|edition=3rd|publisher=Addison Wesley Longman|url=https://web.engr.oregonstate.edu/~budd/Books/oopintro3e/info/ReadMe.html|chapter=A Case Study: The Eight Queens Puzzle|chapter-url=https://web.engr.oregonstate.edu/~budd/Books/oopintro3e/info/chap06.pdf|pages=125–145|isbn=0-201-76031-2}}
* {{cite book|last=Wirth|first=Niklaus|date=2004|orig-date=updated 2012|title=Algorithms and Data Structures|version=Oberon version with corrections and authorized modifications|url=https://people.inf.ethz.ch/wirth/AD.pdf|chapter=The Eight Queens Problem|pages=114–118}}

==External links==
{{wikibooks|Algorithm Implementation|Miscellaneous/N-Queens|N-queens problem}}
* {{Mathworld|title=Queens Problem|id=QueensProblem}}
* {{GitHub|sblendorio/queens-cpm}} Eight Queens Puzzle in Turbo Pascal for CP/M
* {{GitHub|gitpel/python-for-fun/blob/master/eight-queens.py}} Eight Queens Puzzle one line solution in Python
* [http://rosettacode.org/wiki/N-queens_problem Solutions in more than 100 different programming languages] (on [[Rosetta Code]])

{{Magic polygons}}

{{DEFAULTSORT:Eight Queens Puzzle}}
[[Category:Mathematical chess problems]]
[[Category:Enumerative combinatorics]]
[[Category:1848 in chess]]
[[Category:Mathematical problems]]