| Variable | Value |
|---|---|
| $n | 4 |
A classic combinatorial problem that demonstrates the power of recursive trial-and-error (Backtracking).
Place N queens on an N×N board such that no two queens attack each other. This means no two queens can be in the same row, column, or diagonal.