Why It Works

This works because we are using an optimistic estimate.

Once we reach the goal having expanded only best nodes, we know there is no better way. Why? Because the best possible path would still have a cost of at least zero... it won't improve over what we already have.

Thus, we identify the shortest path without ever having to explicitly check all possible paths.


next up previous
Next: Negative Costs Up: Heuristic Search Previous: Dijkstra Example