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

Name: Lecture 5: Search: Optimal, Branch and Bound, A*
Uploaded: 2014-01-10T19:38:06Z
Duration: 48 min 37 s
Description: 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

48:37

Up Next

Lecture 6: Search: Games, Minimax, and Alpha-Beta

Continue

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