Limited Visibility Cops and Robbers

Abstract: We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter $\ell$. We consider the basic consequences of this definition for some simple graph families, and show that this model is not monotonic, unlike common models where the robber is invisible. We see that cops' strategy consists of a phase in which they need to "see" the robber (move within distance $\ell$ of the robber), followed by a phase in which they capture the robber. In some graphs the first phase is the most resource intensive phase (in terms of number of cops needed), while in other graphs, it is the second phase. Finally, we characterize those trees for which $k$ cops are sufficient to guarantee capture of the robber for all $\ell \ge 1$.