N-Queens Problem: 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 October 2022

    • curprev 10:5910:59, 10 October 2022‎ Admin talk contribs‎ 1,145 bytes +1,145‎ Created page with "== Problem Description== The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. Generate all possible configurations of queens on board and print a configuration that satisfies the given constraints. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="10..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/N-Queens_Problem"