-2

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

Pasan Sumanaratne
  • 795
  • 6
  • 13
  • Maybe https://softwareengineering.stackexchange.com/questions/197894/how-does-jump-point-search-algorithm-work-and-why-is-it-so-efficient and for the implementation: https://github.com/ClintFMullins/JumpPointSearch-Java (similar question without answer: Similar: http://stackoverflow.com/questions/43639533/path-finding-algorithms-a-vs-jump-point-search?rq=1) –  Apr 28 '17 at 05:37
  • @RC. as you can, there was no answer there. – whiplash Apr 28 '17 at 05:39
  • @ArunSubramanian yup I saw that –  Apr 28 '17 at 05:40
  • 1
    Saw that, there was no answer.. – Pasan Sumanaratne Apr 28 '17 at 05:40

1 Answers1

2

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:

whiplash
  • 695
  • 5
  • 20