Greedy Best First Search.md

title	date	lastmod
Greedy Best First Search	2022-11-08	2022-11-21

Greedy Search

Expands the node that appears to be closest to the goal based on the evaluation function h(n) i.e. expands the lowest h(n) values first.

Completeness: No Optimality: No Time Complexity: $O(b^m)$ Space Complexity: $O(b^m)$

Graph Traversal

Assuming ties are handled in alphabetical order

Expansion Order: A > B > C > G Final Path: A > B > C > G