(classic problem)
Definition: Place eight chess queens on an 8 × 8 board such that no queen can attack another. Efficiently find all possible placements.
Generalization (I am a kind of ...)
n queens.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 18 December 2006.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "8 queens", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 18 December 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/eightqueens.html
