Capturing an Evader in a Polygonal Environment with Obstacles
Deepak Bhadauria and Volkan Isler
We study a pursuit-evasion game in which one or more cops try to capture a robber by moving onto the robber's current location. All players have equal maximum velocities. They can observe each other at all times. We show that three cops can capture the robber in any polygonal environment (which can contain any finite number of holes).