Explicit solutions to the N -queens problem for all N

1991/02/01 by Bo Bernhardsson · 3 citations
Computer Science · #Constraint Satisfaction and Optimization #Data Management and Algorithms #Advanced Graph Theory Research

paper · doi:10.1145/122319.122322

openalex publication_date 1991/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21

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.

Cited by

• Efficient local search with conflict minimization: a case study of the n-queens problem
• A survey of known results and research areas for n -queens
• Eight queens puzzle [wikipedia]