Simple Search

simple

simple

Given a simple search algorithm:

  1. If no obstacle in direction of goal, set direction to goal
  2. Move in direction
  3. If goal reached, then done
  4. If obstacle
  5. Turn left/right around obstacle (pick 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

Have ONE person from each group submit the group's answers:

Make sure to include the names of all group members.

Happy searching!

-- Mark