**Go backward to** Solution to part (b): Breadth-first search

**Go up to** 3 Comparting Different Search Strategies

**Go forward to** Solution to part (d): Best-first search

## Solution to part (c): Least-cost-first search

- What is the final path found?
*s -> c -> d -> e -> f -> g*.
- How many nodes were expanded?
10
- Explain why it selected
nodes during the search that were not on the shortest path from
*s* to
*g*.
It explores the paths in order of length, irrespective of where the
goal is.
- Explain why it may have been led astray in the final solution.
It wasn't; least cost first always finds the shortest path to the goal.

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