Dijkstra (Counting Solutions; Constructing solutions n-Queens Problem)

From Algorithm Wiki

Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://dl.acm.org/citation.cfm?id=1243380")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Reference

https://dl.acm.org/citation.cfm?id=1243380

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dijkstra_(Counting_Solutions;_Constructing_solutions_n-Queens_Problem)&oldid=45543"