I have been trying to implement Jump-point pathfinding to my already implemented A* pathfinding code, but there is one major problem to this, I don't fully understand how it works. The website here(Which is all that I could find on the topic of Jump-point searching): <a href="http://harablog.wordpress.com/2011/09/07/jump-point-search/" rel="nofollow">http://harablog.wordpress.com/2011/09/07/jump-point-search/</a> doesn't really explain much about how to prune, and how to determine a Jump-point successor. If anyone could explain these two things in detail, It would be much appreciated.