Greedy Best First Search

Last updated Nov 8, 2022 Edit Source

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)$

Assuming ties are handled in alphabetical order

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