NIST

n queens

(classic problem)

Definition: Place n chess queens on an n × n board such that no queen can attack another. Efficiently find all possible placements.

See also 8 queens.

Note: A backtracking algorithm may be efficient enough for small values of n.

Author: PEB

Implementation

Barzan "Tony" Antal's backtracking (or depth-first) solution (C++), which has an explanation.
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 April 2019.
HTML page formatted Mon Apr 22 12:17:39 2019.

Cite this as:
Paul E. Black, "n queens", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 April 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/nqueens.html