Markk

Members
  • Content count

    1
  • Joined

  • Last visited

Community Reputation

107 Neutral

About Markk

  • Rank
    Newbie
  1. Hi! I'm trying to implement the Jump Point Search algorithm into Java, but having a hard time understanding one part of it.The algorithm is explained in [url="http://users.cecs.anu.edu.au/~dharabor/data/papers/harabor-grastien-aaai11.pdf"]this paper[/url], and I'm using the [url="https://github.com/qiao/PathFinding.js/blob/master/src/finders/JumpPointFinder.js"]source[/url] of [url="http://qiao.github.com/PathFinding.js/visual/"]this JPS implementation[/url] as an example. When using my example implementation with to find the path around a wall, I get this: [img]http://i.stack.imgur.com/p1gdl.jpg[/img] The green and red squares represent the start and end "tiles", gray is wall, blue and lightgreen are jump points (I guess the lightgreens are in the open list, blue in the closed). Now, I get why the tiles at the green arrows came out as jump points, since they all got one forced neighbour, but can someone explain to me why the tiles at the red arrows are jump points? Thanks!