Prev Up
Go backward to Solution to part (d): Best-first search
Go up to 3 Comparting Different Search Strategies

Solution to part (e): A* search

  1. What is the final path found? s -> c -> d -> e -> f -> g.
  2. How many nodes were expanded? 7.
  3. Explain why it selected nodes during the search that were not on the shortest path from s to g. 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.
  4. Explain why it may have been led astray in the final solution. . It wasn't; A* always finds the shortest path to the goal.

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

Prev Up