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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 29 June 2021.
HTML page formatted Tue Jun 29 14:16:18 2021.
Cite this as:
Paul E. Black, "n queens", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 29 June 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/nqueens.html