I'm confused. JPS checks whether an adjacent node is a "wall" (or otherwise-arbitrarily-high cost node), and uses that information to either keep going in the

I'm confused. JPS checks whether an adjacent node is a "wall" (or otherwise-arbitrarily-high cost node), and uses that information to either keep going in the same direction or add more "open" nodes. It seems that it assumes each node has "local" information about local nodes. I think JPS's main contribution is that there are fewer "open" nodes added over the life of the algorithm than A*, right ? The number of open nodes is roughly the "branching factor", and reducing that reduces the total amount of work done.