n-Queens Problem
Given 𝑛 number of chess queens, this demonstration shows how those queens can always be placed in an 𝑛 × 𝑛 sized chess board such that none can capture any other.
Be careful with sizes > 20!
Computation time:
Given 𝑛 number of chess queens, this demonstration shows how those queens can always be placed in an 𝑛 × 𝑛 sized chess board such that none can capture any other.