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
- What is the final path found?
s -> a -> b -> g.
- How many nodes were expanded?
- Explain why it selected
nodes during the search that were not on the shortest path from s to
It chooses the node closest to the goal, and doesn't take into account
the path length from the start node.
- 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.
material, ©David Poole, Alan Mackworth and Randy Goebel, 1999