We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...