Go backward to Solution to part (a)
Go up to 1 Finding Paths in a Grid
Go forward to Solution to part (c)
Solution to part (b)
A* search:
Note that here we assumed that for those nodes whose f-value is the
same, that the last added to the queue is used. You can use any other
convention.
Computational
Intelligence online
material, ©David Poole, Alan Mackworth and Randy Goebel, 1999