AI-Class: Worked Example of Cheapest First Search

While the lectures are great in general, I thought that the section on Uniform Cost Search (2.12-2.17) became slightly confusing, with the corrections and everything. Therefore, I have made my own video (12 minutes) walking through the example.

I also draw the search tree that arises from searching the graph, because I think it helps to clarify what the frontier is. At the end I address the issue of counting the number of nodes expanded, including the start and goal nodes.

I hope some of you find it helpful. Comments welcome!