NIST

8 queens

(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


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 18 December 2006.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "8 queens", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 18 December 2006. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/eightqueens.html