Abstract
Wall Cops and Robbers is a new vertex pursuit game played on graphs, inspired by both the games of Cops and Robbers and Conway’s Angel Problem. In the game, the cops are free to move to any vertex and build a wall; once a vertex contains a wall, the robber may not move there. Otherwise, the robber moves from vertex-to-vertex along edges. The cops capture the robber if the robber is surrounded by walls. The wall capture time of a graph G, written \( W_{{c_{t} }} (G) \) is the least number of moves it takes for one cop to capture the robber in G. In the present note, we focus on the wall capture time of certain infinite grids. We give upper bounds on the wall capture time for Cartesian, strong, and triangular grids, while giving the exact value for hexagonal grids. We conclude with open problems.
Supported by grants from NSERC and Ryerson University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Quilliot, A.: Jeux et pointes fixes sur les graphes. Thèse de 3ème cycle, pp. 131–145. Université de Paris VI (1978)
Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 235–239 (1983)
Bonato, A., Nowakowski, R.J.: The game of Cops and Robbers on graphs. American Mathematical Society, Providence, Rhode Island (2011)
Baird, W., Bonato, A.: Meyniel’s conjecture on the cop number: a survey. J. Comb. 3, 225–238 (2012)
Bonato, A.: WHAT IS … Cop Number? Notices American Math. Soc. 59, 1100–1101 (2012)
Bonato, A.: Catch me if you can: Cops and Robbers on graphs. In: Proceedings of the 6th International Conference on Mathematical and Computational Models (ICMCM’11) (2011)
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning ways for your mathematical plays, vol. 2. Academic Press, New York (1982)
Conway, J.H.: The angel problem. In: Nowakowski R. (ed.) Games of No Chance, vol. 29, pp. 3–12. MSRI Publications (1996)
Hartnell, B.: Firefighter! An application of domination. Presentation at the 25th Manitoba Conference on Combinatorial Mathematics and Computing. University of Manitoba, Winnipeg, Canada (1995)
Finbow, S., MacGillivray, G.: The firefighter problem: a survey of results, directions and questions. Australasian J. Comb. 43, 57–77 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Bonato, A., Inerney, F.M. (2016). The Game of Wall Cops and Robbers. In: Senthilkumar, M., Ramasamy, V., Sheen, S., Veeramani, C., Bonato, A., Batten, L. (eds) Computational Intelligence, Cyber Security and Computational Models. Advances in Intelligent Systems and Computing, vol 412. Springer, Singapore. https://doi.org/10.1007/978-981-10-0251-9_1
Download citation
DOI: https://doi.org/10.1007/978-981-10-0251-9_1
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0250-2
Online ISBN: 978-981-10-0251-9
eBook Packages: EngineeringEngineering (R0)