Explicit solutions to the N -queens problem for all N
Bo Bernhardsson · ACM SIGART Bulletin · 1991
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.