Search code examples
algorithmpath-findinga-starheuristics

Heuristic for A* when only diagonal movement is allowed

I'm planning to use A* algorithm for path finding on a infinite grid with obstacles where only diagonal movements are allowed.But I'm not sure about which heuristic to use.I know that I cannot use Manhattan Distance.Can anyone suggest something ?

Solution

  • Think chess. Rotate 45 degrees. If only diagonal movement is allowed, in effect it's just like a grid with only orthogonal movement, but half the points on the original grid are unreachable.