homepage: https://github.com/isovector/jps#readme
changelog-type: markdown
hash: 6fd550edffe69bc4061d1e0f3f00b951c1b6fa4c4d2426fd151ea25374c975c2
test-bench-deps: {}
maintainer: Sandy Maguire <sandy@sandymaguire.me>
synopsis: Jump point search for Haskell
changelog: ! '# Changelog for jps


  ## 0.1.0.0  -- 2018-08-19


  * First version. Released on an unsuspecting world.


  ## Unreleased changes

'
basic-deps:
  fingertree: -any
  base: ! '>=4.7 && <5'
  containers: -any
  lens: -any
  vector: -any
all-versions:
- '0.1.0.0'
author: Zachary Kamerling
latest: '0.1.0.0'
description-type: markdown
description: ! '# jps -- jump point search for Haskell


  [![Build Status](https://travis-ci.org/isovector/jps.svg?branch=master)](https://travis-ci.org/isovector/jps)
  | [Hackage][hackage]


  [hackage]: https://hackage.haskell.org/package/jps


  ## 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][jps]''s excellent explanation.


  [jps]: https://zerowidth.com/2013/05/05/jump-point-search-explained.html


  `jps` is a Haskell implementation of jump point search. It was originally

  written by [Zachary Kamerling][zachary] and is maintained by [Sandy

  Maguire][isovector].


  [zachary]: https://github.com/ZacharyKamerling

  [isovector]: https://github.com/isovector


'
license-name: BSD3

Update from Hackage at 2018-08-20T01:34:41Z
Update from Hackage at 2018-08-20T01:34:41Z
