2000 character limit reached
Catching a fast robber on the grid (1609.01002v2)
Published 5 Sep 2016 in math.CO and cs.DM
Abstract: We study the problem of cops and robbers on the grid where the robber is allowed to move faster than the cops. It is well known that two cops are necessary and sufficient to catch the robber on any finite grid when the robber has unit speed. Here, we prove that when the speed of the robber is a sufficiently large constant, the number of cops needed to catch the robber on an $n \times n$ grid is $\exp(\Omega(\log n / \log \log n))$.
Collections
Sign up for free to add this paper to one or more collections.
