n-Queens Completion (n-Queens Problem)
Jump to navigation Jump to search
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.
$n$: size of chessboard
$k$: number of queens given
Table of Algorithms
|Grigoryan||2018||$O(n)$||$O(n)$||error < 0.0001 and decreases with increasing n||Randomized||Time|