Pathfinder - Jump Point Search?

[swood]

I just found this amazing project on Github, which gives a great representation of how different pathfinding algorithms work. As expected, the A* algorithm currently used in the game works just fine, but the new Jump Point Search algorithm is unbelievably fast!

Since I'm not exactly experienced in AI- or pathfinding coding, I was wondering if implementing the Jump Point Search was possible and if the effort would be justified by increased performance?

http://qiao.github.i...ding.js/visual/

[Yves]

Check out this.

[quantumstate]

There is a stalled pathfinder improvement patch which uses JPS. http://trac.wildfiregames.com/ticket/1756

Edit: Yves has already pointed to a forum thread about this same thing.

[swood]

Ah, I must have overlooked this one. Thanks anyways.

[scroogie]

So if I see that correctly, the WIP-Pathfinder is a hierarchical A* with JPS optimization on a Grid of 16 cells per terrain cell with unit-based clearance and using a points-of-visibility algorithm with higher precision obstruction edges on the local step (local being the way to the next high level waypoint?)?

That seems like quite a beast.