Sign in to follow this  
polyfrag

Jump Point Search

Recommended Posts

Need help understanding how this works.

 

It seems like it expands to fill all available space. How is it 10 times faster than A* then?

 

Also, a question about this step (in red)...

jps.jpg

 

 

When we find the forced neighbour, why don't we place a node to the open set right near the forced neighbour and store how we arrived there from the previous step (EXPANSION_NORTHEAST_THEN_EAST) but instead place the node closer to the parent there, where we'll have to find the forced neighbour again? And how do we know not to expand to all directions again?

 

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this