Lecture Videos

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

Description: 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

Transcript

Course Info

Learning Resource Types

grading Exams
theaters Lecture Videos
theaters Recitation Videos
assignment Programming Assignments
co_present Instructor Insights