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

Authors

174

  1. RS
    Rok Sosič

    Stanford University, United States

    4 publications · 288 citations

    4

    h-index

  2. CE
    Cengiz Erbaş

    Southern Methodist University, United States

    4 publications · 92 citations

    4

    h-index

  3. MM
    Murat M. Tanik

    University of Alabama at Birmingham, United States

    4 publications · 92 citations

    4

    h-index

  4. JG
    Jun Gu

    Tsinghua University, China

    3 publications · 235 citations

    3

    h-index

  5. IR
    Igor Rivin

    Temple University, United States

    3 publications · 100 citations

    3

    h-index

1–5 of 174

Venues

  1. Discrete Mathematics

    7 publications · 104 citations

    7

    h-index

  2. Information Processing Letters

    5 publications · 123 citations

    5

    h-index

  3. Biological Cybernetics

    4 publications · 95 citations

    4

    h-index

  4. ACM SIGART Bulletin

    3 publications · 183 citations

    3

    h-index

  5. arXiv (Cornell University)

    Repository · 3 publications · 252 citations

    3

    h-index

1–5