Catching an infinitely fast robber on a grid [article]

William B. Kinnersley, Nikolas Townsend
2022 arXiv   pre-print
We consider a variant of Cops and Robbers in which the robber may traverse as many edges as he likes in each turn, with the constraint that he cannot pass through any vertex occupied by a cop. We study this model on several classes of grid-like graphs. In particular, we determine the cop numbers for two-dimensional Cartesian grids and tori up to an additive constant, and we give asymptotic bounds for the cop numbers of higher-dimensional grids and hypercubes.
arXiv:2107.14193v2 fatcat:xv4f3rbqbfedvpznou7q44mxke