Jump point search for Haskell

Latest on Hackage:

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow to host generated Haddocks.

BSD3 licensed by Zachary Kamerling
Maintained by Sandy Maguire

jps – jump point search for Haskell

Build Status | Hackage


People take the longest possible paths, digress to numerous dead ends, and make all kinds of mistakes.Then historians come along and write summaries of this messy, nonlinear process and make it appear like a simple, straight line.

Dean Kamen


Jump point search is a variant of A* that cuts down on the search space by assuming you always want to continue in a straight line. As such, it runs remarkably faster on graphs that are mostly open.

For a fantastic introduction to how the algorithm works, check out zerowidth positive lookahead’s excellent explanation.

jps is a Haskell implementation of jump point search. It was originally written by Zachary Kamerling and is maintained by Sandy Maguire.


Changelog for jps – 2018-08-19

  • First version. Released on an unsuspecting world.

Unreleased changes

Depends on 5 packages:
Used by 1 package:
comments powered byDisqus