Variations of cops and robbers game on grids

Sandip Das, Harmender Gahlawat

Abstract: Cops and robber is a two player turn-based game played on a graph where cops try to capture the robber. The cop number of a graph is the minimum number of cops required to capture the robber. We consider two variants of this game, namely cops and attacking robber and lazy cops and robber. In cops and attacking robber version, the robber can attack a cop and remove that cop from the game, whereas in lazy cops and robber version only one cop is allowed to move on a cop’s turn. We investigate the cop number of various grids (planar, cylindrical, toroidal and high dimension) and hypercubes for these variants.