Skip to content

Jump Point Search

The Jump Point Search algorithm is an optimized form of A. It is faster than A in most cases. The algorithm ignores symmetric paths and accesses the open and closed lists less often in order to decrease path calculation times.

Jump Point Search is limited in that it can only be used on uniform cost grids. This means that all tiles (areas) should have the same cost; in NavTiles' case, this cost is 0. If you want to use pathfinding with varying tile costs, use the A* algorithm.

For more information on the Jump Point Search algorithm, check out this page.