Greedy Best-First Search (Informed Search Informed Search)

From Algorithm Wiki

Revision as of 11:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(b^d)$ == Space Complexity == $O(b^d)$ words (https://en.wikipedia.org/wiki/Breadth-first_search: Stores all generated nodes in memory) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1959 == Reference ==")

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

Jump to navigation Jump to search

Time Complexity

$O(b^d)$

Space Complexity

$O(b^d)$ words

(https://en.wikipedia.org/wiki/Breadth-first_search: Stores all generated nodes in memory)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1959

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Greedy_Best-First_Search_(Informed_Search_Informed_Search)&oldid=44645"