6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
|
|
|
Next: Uniform Cost Search (Branch and Bound) Previous: Avoiding Repeated States
Maze Example
Imagine states are cells in a maze, and you can move N, E, S, or W. What would BFS do, assuming it always expanded the E child first, then N, then W, then S? What about DFS? What if the order changed to N, E, S, W, and loops are prevented?
