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

MIT Artificial Intelligence, Fall 2010 View the complete course: Instructor: Patrick Winston 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. License: Creative Commons BY-NC-SA More information at More courses at