Simple Search

Given a simple search algorithm to move an avatar towards a goal:

1. If no obstacle next to avatar in direction of goal, set direction to goal
2. Move in direction
3. If goal reached, then done
4. If hit obstacle
5. Pick direction left/right (randomly)
6. Goto step a

1. What path would be followed for each maze above?

2. Is the simple algorithm complete?

3. Is the simple algorithm optimal?

Hand-in

Each person in a group should submit their answers:

https://wpi.qualtrics.com/jfe/form/SV_54GJKGFQsKmgZdY

Make sure to include the names of all group members.

Happy searching!

– Mark