Search code examples
javaalgorithmgraph-algorithmpath-finding

Algorithms : What is the difference between A* and Jump Point Search?

I need to know why Jump Point Search is better than A* for path finding?

Solution

  • As to why Jump Point Search is better than A*, it is because, Jump Point Search algorithm does not evaluate all nodes like A* but rather "jumps" or skips over few nodes in the tree/graph. This ensures that fewer nodes are expanded and hence quickening up your algorithm's running time.

    A detailed paper on this can be found here: