A robber is hiding at a crossroads in a modern city, where the roads are all at right angles and equally spaced.
Can you help the police to find him?
Choose coordinates where you think the robber might be hiding. The interactivity tells you the shortest distance to the robber, travelling along the roads.
Try to find the robber using only a few guesses.
Can you guarantee to always find the robber in less than five guesses?
Can you do better than this?
How would your strategy change if the robber were allowed to move 1 block after each guess?
Can you think of any other mathematically interesting variations of the game?