Greedy Best-First Search (GBFS) is an algorithm that explores a graph by expanding the node that is closest to the goal, based on a heuristic function h(n). Unlike A*, it does not consider the cost to reach the current node (g(n)). This makes it faster but not always optimal.
Heuristic Function (h(n)): Estimates the cost from the current node to the goal. The algorithm always chooses the node with the lowest h(n).
Why a Node is Chosen: The node with the lowest heuristic value (h(n)) is selected from the frontier.
Goal Vector: undefined
Frontier: []
Estimated Cost (E): []
Visiting: undefined
To Visit: undefined
Currently visitable nodes: undefined
Path Cost g(n): undefined
Estimated Cost h(n): undefined
Total Cost f(n): undefined