N-Queens Completion: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: size of chessboard | $n$: size of chessboard | ||
k: number of queens given | $k$: number of queens given | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 09:25, 10 April 2023
Description
Given an $n \times n$ chessboard that already has $k$ queens on it, complete the board such that there are $n$ queens, all of which cannot attack each other.
Related Problems
Related: Counting Solutions, Constructing Solutions
Parameters
$n$: size of chessboard
$k$: number of queens given
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Grigoryan | 2018 | $O(n)$ | $O(n)$ | error < 0.0001 and decreases with increasing n | Randomized | Time |