6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
Next:
Iterative Deepening Search
Previous:
Uniform Cost Search (Branch and Bound)
Example
Click mouse to advance to next frame. Resolve ties alphabetically and based on depth.