When we need to find the shortest distance between two points in a grid with obstacles, it is easy to use A* algorithm. You can find more details from the following address.
http://www.policyalmanac.org/games/aStarTutorial.htm
Thursday, July 30, 2009
Subscribe to:
Posts (Atom)