Constructing Solutions (n-Queens Problem)
Jump to navigation
Jump to search
Description
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
Parameters
$n$: number of queens, size of chessboard
Table of Algorithms
Currently no algorithms in our database for the given problem.