Problemintro
N-queens problem
Also called Eight queens puzzle, eight queens, eight queens puzzle.
Place n queens on an n-by-n board so that no two attack each other; a classic backtracking example.
Place n queens on an n-by-n board so that no two attack each other; a classic backtracking example.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag TH2QRV Edit this page History Report an error