Constructing Solutions: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of queens, size of chessboard | $n$: number of queens, size of chessboard | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 09:25, 10 April 2023
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