Best-first Search

Given the best-first search algorithm:

  1. Head straight for goal
  2. Computes distance of every node in open list to goal
  3. Pick node with shortest distance to goal as node to add to path
  1. What path would be followed for the maze below?
best-first

best-first

  1. What path would be followed for the maze below?
best-first

best-first

  1. Is the best-first algorithm more efficient than breadth-first?

  2. Is best-first complete?

  3. Is best-first 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