Explicit solutions to the N -queens problem for all N
- 1 February 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGART Bulletin
- Vol. 2 (2) , 7
- https://doi.org/10.1145/122319.122322
Abstract
The n -queens problem is often used as a benchmark problem for AI research and in combinatorial optimization. An example is the recent article [1] in this magazine that presented a polynomial time algorithm for finding a solution. Several CPU-hours were spent finding solutions for some n up to 500,000.Keywords
This publication has 2 references indexed in Scilit:
- A polynomial time algorithm for the N-Queens problemACM SIGART Bulletin, 1990
- Constructions for the Solution of the m Queens ProblemMathematics Magazine, 1969