Constructing Solutions: Difference between revisions
Jump to navigation
Jump to search
(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...") |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
$n$: number of queens, size of chessboard | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 08: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