The robber is hiding in a modern city, where the roads are all at
right angles and equally spaced. Imagine the grid lines represent
roads. The robber is hiding at a crossroads.
Input coordinates to help the police search and find the robber
with the fewest guesses. The interactivity gives you the shortest
distance you'd have to travel (along the roads) to reach the
robber.
Can you find a reliable strategy for choosing coordinates that will
locate the robber in the minimum number of guesses?