Determine an algorithm that can guarantee hitting an adversarially jumping Kangaroo that starts at some unkown (x,y) in the 2D plane, where both x,y are integers, and jumps randomly into one of the 8 surrounding integer points. You can shoot once at a chosen point (depending on the algorithm) simultaneously as the Kangaroo reaches its next spot in the 2D plane.