jps: Jump point search for Haskell
Downloads
- jps-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.7 && <5), containers, fingertree, lens, vector [details] |
| License | BSD-3-Clause |
| Copyright | 2018 Zachary Kamerling |
| Author | Zachary Kamerling |
| Maintainer | Sandy Maguire <sandy@sandymaguire.me> |
| Category | Algorithm |
| Home page | https://github.com/isovector/jps#readme |
| Bug tracker | https://github.com/isovector/jps/issues |
| Source repo | head: git clone https://github.com/isovector/jps |
| Uploaded | by isovector at 2018-08-20T01:29:17Z |
| Distributions | NixOS:0.1.0.0 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 798 total (7 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2018-08-20 [all 1 reports] |
Readme for jps-0.1.0.0
[back to package description]jps -- jump point search for Haskell
| Hackage
Dedication
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
Overview
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.