Course contentsShow
Computer Science
Lesson 1008 of 2,87223. Shortest Path AlgorithmsPro lesson

A* Correctness and Optimality

Prove that A* with admissible heuristics always finds the shortest path and terminates.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.