Generation of Combinatorial Objects · Backtracking
Lesson 1
In the \(n\)-queens problem, one needs to place \(n\) non-attacking queens on a board of size \(n\times n\).
![]()
As \(n\) grows, placing the queens manually becomes more and more difficult. Try it!