Constructing Solutions: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 10:2610:26, 15 February 2023Admin talk contribs 515 bytes +515 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..."