I think you have to use a*

or dijkstra algorithm.

Problem #5. (Programming) Jump (20 pts) We would like to cross over a river by stepstones. The position of a stepstone is represented by (x,y) You can jump to another stepstone, however, you have certain constraint due to your physical ability When you are at (x,y), you are only allowed to jump to stones at (x',y') where lx - x'l