Nauck (Counting Solutions; Constructing solutions n-Queens Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n!)$
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1850