Prev Up Next
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

  1. What is the final path found? s -> c -> d -> e -> f -> g.
  2. How many nodes were expanded? 10
  3. 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.
  4. 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

Prev Up Next