Go up to 3 Comparting Different Search Strategies
Go forward to Solution to part (b): Breadth-first search
Solution to part (a): Depth-first search
- What is the final path found?
s -> a -> b -> h -> i -> 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 selects nodes in order irrespective of where the goal is.
- Explain why it may have been led astray in the final solution.
It reports whatever path it finds first; this could be any path
depending on the order of the neighbours.
material, ©David Poole, Alan Mackworth and Randy Goebel, 1999