Constructing Solutions (n-Queens Problem)
Revision as of 11:26, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Constructing Solutions (n-Queens Problem)}} == 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 == <pre>n: number of queens, size of chessboard</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == References/Citation == ht...")
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.
References/Citation
https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=1243380