Prev Up Next
Go backward to Solution to part (c): Least-cost-first search
Go up to 3 Comparting Different Search Strategies
Go forward to Solution to part (e): A* search

Solution to part (d): Best-first search

  1. What is the final path found? s -> a -> b -> g.
  2. How many nodes were expanded? 4
  3. Explain why it selected nodes during the search that were not on the shortest path from s to g. It chooses the node closest to the goal, and doesn't take into account the path length from the start node.
  4. Explain why it may have been led astray in the final solution. Node a was closer to the goal than node c, once it had nodes on the frontier that were close to goal, it never considered c.

Computational Intelligence online material, ©David Poole, Alan Mackworth and Randy Goebel, 1999

Prev Up Next