N-Queens Problem
Revision as of 10:59, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. Generate all possible configurations of queens on board and print a configuration that satisfies the given constraints. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="10...")
Problem Description
The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. Generate all possible configurations of queens on board and print a configuration that satisfies the given constraints.
Bounds Chart
Step Chart
Improvement Table
| Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
|---|---|---|
| Exp/Factorial | [ Naive Algorithm (1848)]
[ Naive + 1 queen per row restriction (1850)] [ Nauck (1850)] [ Gunther Determinants solution (1874)] |
|
| Polynomial > 3 | ||
| Cubic | ||
| Quadratic | ||
| nlogn | ||
| Linear | ||
| logn |