27 Jan 2005
CS 3243 - Heuristics
12
Properties of greedy best-first search
nComplete? No – can get stuck in loops,
e.g., Iasi à Neamt à Iasi à Neamt à … nTime? O(bm), but a good heuristic can give
dramatic improvement
e.g., Iasi à Neamt à Iasi à Neamt à … nTime? O(bm), but a good heuristic can give
dramatic improvement
nSpace? O(bm): keeps all nodes in memory
nOptimal? No
