Prev Up Next
Go backward to Solution to part (c)
Go up to 1 Finding Paths in a Grid
Go forward to Solution to part (e)

Solution to part (d)

It seems as though A* and dynamic programming are best for this problem. A* would be best if you were solving it once. If you wanted to solve it multiple times for the same goal dynamic programming would be good. Depth-first search looks pretty stupid given this ordering of neighbors. If you had searched in the order: left, up, right, down, depth-first search would have looked much more sensible.
Computational Intelligence online material, ©David Poole, Alan Mackworth and Randy Goebel, 1999

Prev Up Next