The Cop Number of the One-Cop-Moves Game on Planar Graphs
Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph’s edges with perfect information about each other’s positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aigner and Frommer established that in every connected planar graph, three cops are sufficient to capture a single robber. In this paper, we consider a recently studied variant of the cops-and-robbers game, alternately called the one-active-cop game, one-cop-moves game or the lazy-cops-and-robbers game, where at most one cop can move during any round. We show that Aigner and Frommer’s result does not generalise to this game variant by constructing a connected planar graph on which a robber can indefinitely evade three cops in the one-cop-moves game. This answers a question recently raised by Sullivan, Townsend and Werzanski.
- 8.Gao, Z., Yang, B.: The cop number of the one-cop-moves game on planar graphs. Preprint. https://arxiv.org/pdf/1705.11184v2.pdf
- 9.Isaza, A., Lu, J., Bulitko, V., Greiner, R.: A cover-based approach to multi-agent moving target pursuit. In: Proceedings of the 4th Conference on Artificial Intelligence and Interactive Digital Entertainment, pp. 54–59 (2008)Google Scholar
- 12.Moldenhauer, C., Sturtevant, N.R.: Evaluating strategies for running from the cops. In: Proceedings of the 21st International Joint Conference on Artificial intelligence, IJCAI 2009, pp. 584–589 (2009)Google Scholar
- 15.Quilliot, A.: Jeux et pointes fixes sur les graphes. Thèse de 3ème cycle, Universit de Paris VI, pp. 131–145 (1978)Google Scholar
- 18.Sullivan, B.W., Townsend, N., Werzanski, M.: The \(3 \times 3\) rooks graph is the unique smallest graph with lazy cop number 3. Preprint. https://arxiv.org/abs/1606.08485
- 19.West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2000)Google Scholar