N-queens Problem
The N-Queens Problem is a combinatorial puzzle in which the objective is to place N queens on an N×N chessboard such that no two queens threaten each other, distinguishing it from other constraint satisfaction problems by its specific use of chess-based attack rules to define feasible configurations.
87
Publications
4.8K
Citations
174
Authors
94
Institutions
Publications per year
2017–2026
5
Variants
N-queens Puzzle
Parents
87
Symmetry breaking in constraint programming
Ian P. Gent, Barbara M. Smith · 2000 · 192 citations
Donald E. Knuth · arXiv (Cornell University) · 2000 · 186 citations · Full text
1–5 of 87
174
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 174
94
University of Utah
Salt Lake City, United States
4 h-index
5 publications
387 citations

University of Calgary
Calgary, Canada
3 h-index
4 publications
334 citations
Institute of Mathematics
Warsaw, Poland
3 h-index
4 publications
112 citations
Warsaw University of Technology
Warsaw, Poland
3 h-index
4 publications
112 citations

Indiana University – Purdue University Fort Wayne
Fort Wayne, United States
2 h-index
3 publications
66 citations

KTH Royal Institute of Technology
Stockholm, Sweden
2 h-index
2 publications
37 citations

Universidad de Sevilla
Seville, Spain
2 h-index
7 publications
122 citations

Keio University
Tokyo, Japan
2 h-index
7 publications
471 citations
1–8 of 94
7 publications · 104 citations
7
h-index
5 publications · 123 citations
5
h-index
4 publications · 95 citations
4
h-index
3 publications · 183 citations
3
h-index
Repository · 3 publications · 252 citations
3
h-index
1–5