Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
gptkb:Boolean_satisfiability_problem gptkb:combinatorial_problem |
| gptkbp:firstPublished |
1850
|
| gptkbp:generalizes |
eight queens puzzle
|
| gptkbp:hasApplication |
gptkb:artificial_intelligence
parallel computing algorithm design puzzle design |
| gptkbp:notablePerson |
Franz Nauck
Max Bezzel |
| gptkbp:numberOfSolutionsKnownFor |
n=1 to n=27 (as of 2024)
|
| gptkbp:relatedTo |
gptkb:Latin_squares
chess graph theory permutation |
| gptkbp:solvedBy |
constraint programming
heuristic algorithms backtracking algorithms |
| gptkbp:type |
How to place n queens on an n×n chessboard so that no two queens threaten each other
|
| gptkbp:bfsParent |
gptkb:constraint_satisfaction_problem_(CSP)
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
n-queens problem
|