Lecture 5: Search: Optimal, Branch and Bound, A*

Artificial Intelligence Course

This lecture covers strategies for finding the shortest path. We discuss branch and bound, which can be refined by using an extended list or an admissible heuristic, or both (known as A*). We end with an example where the heuristic must be consistent. Instructor: Patrick H. Winston

Lessons in this module

Lecture 5: Search: Optimal, Branch and Bound, A* start lesson