Constructing Solutions (n-Queens Problem)

From Algorithm Wiki
Revision as of 08:25, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


What are all of the ways can one put $n$ queens on an $n \times n$ chessboard so that no two queens attack each other?

Related Problems

Related: Counting Solutions, n-Queens Completion


$n$: number of queens, size of chessboard

Table of Algorithms

Currently no algorithms in our database for the given problem.