Go backward to Solution to part (d): Best-first search
Go up to 3 Comparting Different Search Strategies
Solution to part (e): A* search
- What is the final path found?
s -> c -> d -> e -> f
- How many nodes were expanded?
- Explain why it selected
nodes during the search that were not on the shortest path from s to
Node a looked as thought it was on a direct route to the goal. But, the
deviation to go to b was greater than the cost of going via c.
- Explain why it may have been led astray in the final solution. .
It wasn't; A* always finds the shortest path to the goal.
material, ©David Poole, Alan Mackworth and Randy Goebel, 1999