Best-first Search

Given the best-first search algorithm:

A. Head straight for goal B. Computes distance of every node in open list to goal C. Pick node with shortest distance to goal as node to add to path

1. For the maze below, assume the Diamond on the left is moving to the Circle on the right. What path would be followed?

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

3. Is best-first complete?

4. Is best-first optimal?

Hand-in

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

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

Make sure to include the names of all group members.

Happy searching!

– Mark