Grigoryan (n-Queens Completion n-Queens Problem)

Time Complexity

$O(n)$

Space Complexity

$O(n)$

(Derived: two control arrays of size O(n))

Approximate?

Approximate

Approximation Factor: error < 0.0001 and decreases with increasing n

Randomized?

Yes, Monte Carlo

Year

2018

Reference

https://arxiv.org/abs/1912.05935