(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 23 April 2007.
HTML page formatted Mon Apr 23 09:23:15 2007.
Cite this as:
Paul E. Black, "n queens", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 23 April 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/nqueens.html
