Problem 2

This problem is concerned with applying Breadth-First Search to the maze below.

A

List the predecessor nodes () and distances (d) for each relevant node explored in BFS. Like the example we did in class, you can skip the nodes that dead-end or that arent reachable from the start.

B

What is the distance of the shortest path from the start to the goal?

C

What path through the maze would BFS give as a solution?

start 0) C) goal