Re:Path-finding simulator for grid based games
by teamonkey on Sunday April 22, 2012 @12:27AM
(#3873961)
A* isn't guaranteed to find the best route. Since the algorithm stops as soon as a route is found, a bad heuristic can make it find a relatively poor path.
A*, Chebyshev, Allow Diagonal:
Optimal path should go underneath, but the simulator chooses to go over.