Heuristic Search
Path Problems
Breadth-first Search
Dijkstra's Algorithm
Dijkstra Example
Why It Works
Negative Costs
Better Optimistic Estimate
A* Search
A* Facts
Generating Good Heuristics: 8-Puzzle
Missionaries and Cannibals
Next:
Path Problems
Up:
Heuristic Search (05)
Previous:
More Formally
