Problem 3: A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit’s starting point, A0, and the hunter’s starting point, B0, are the same. After n-1 rounds of the game, the rabbit is at point An-1 and the hunter is at point Bn-1. In the nth round of the game, three things occur in order.
(i) The rabbit moves invisibly to a point An such that the distance between An-1 and An is exactly 1.
(ii) A tracking device reports a point Pn to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between Pn and An is at most 1.
(iii) The hunter moves visibly to a point Bn such that the distance between Bn-1 and Bn is exactly 1.
Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after 109 rounds she can ensure that the distance between her and the rabbit is at most 100?