Dijkstra (Counting Solutions; Constructing solutions n-Queens Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n!)$
Space Complexity
$O(n)$ words
(Keep track of current configuration being tested and restrictions on where next queen can be placed, along with current count)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1972