The classic algorithm for finding shortests paths given an admissible heuristic. We'll deal with the notion of admissibility (summary: admissible = optimistic). We show how you can prove properties of A. We'll also briefly discuss IDA (iterative deepening A*).

Download Slides PDF