# Bounds for Cops and Robber Pursuit

1 ALICE - Geometry and Lighting
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We prove that the robber can evade (that is, stay at least unit distance from) at least $\lfloor n/5.889 \rfloor$ cops patroling an $n \times n$ continuous square region, that a robber can always evade a single cop patroling a square with side length $4$ or larger, and that a single cop on patrol can always capture the robber in a square with side length smaller than $2.189\cdots$.
Document type :
Journal articles

https://hal.inria.fr/inria-00459460
Contributor : Laurent Alonso <>
Submitted on : Wednesday, February 24, 2010 - 9:26:24 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

### Citation

Laurent Alonso, Edward M. Reingold. Bounds for Cops and Robber Pursuit. Computational Geometry, Elsevier, 2010, 43 (9), pp.749-766. ⟨10.1016/j.comgeo.2010.02.002⟩. ⟨inria-00459460⟩

Record views