Abstract
Cops and robber is a two player turn based game played on a graph where the cops try to catch the robber. The cop number of a graph is the minimum number of cops required to catch the robber. We consider two variants of this game, namely cops and attacking robber, and lazy cops and robber. In cops and attacking robber, the robber can attack a cop and remove him from the game, whereas in lazy cops and robber only one cop is allowed to move during the cop’s turn. We prove that the cop number for both these variants in finite square grids is two. We show that the cop number for cops and attacking robber in n-dimensional hypercube is at most n, and the cop number in the same version of a 3-dimensional grid is three.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8, 1–12 (1984)
Offner, D., Okajian, K.: Variations of cops and robber on the hypercube. Aust. J. Comb. 59(2), 229–250 (2014)
Bal, D., Bonato, A., Kinnersley, W.B., Pralat, P.: Lazy cops and robbers on hypercubes. Comb. Probab. Comput. 24(6), 829–837 (2015)
Sim, K.A., Tan, T.S., Wong, K.B.: Lazy cops and robbers on generalized hypercubes. Discrete Math. 340(7), 1693–1704 (2017)
Fomin, F., Golovach, P., Kratochvil, J., Nisse, N., Suchan, K.: Pursuing a fast robber on a graph. Theor. Comput. Sci. 411, 1167–1181 (2010)
Luccio, F., Pagli, L.: Cops and robber on grids and tori. CoRR, abs/1708.08255 (2017)
Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 253–259 (1983)
Quillot, P.: A short note about pursuit games payed on a graph of given genus. J. Comb. Theory Ser. B 38, 89–92 (1985)
Goldstein, A.S., Reingold, E.M.: The complexity of pursuit on a graph. Theor. Comput. Sci. 143, 93–112 (1995)
Bonato, A., Nowakowski, R.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)
Bonato, A., et al.: The robber strikes back. In: Krishnan, G.S.S., Anitha, R., Lekshmi, R.S., Kumar, M.S., Bonato, A., Graña, M. (eds.) Computational Intelligence, Cyber Security and Computational Models. AISC, vol. 246, pp. 3–12. Springer, New Delhi (2014). https://doi.org/10.1007/978-81-322-1680-3_1
Bhattacharya, S., Paul, G., Sanyal, S.: A cops and robber game in multidimensional grids. Discrete Appl. Math. 58, 1745–1751 (2010)
West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, Essex (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Das, S., Gahlawat, H. (2018). Variations of Cops and Robbers Game on Grids. In: Panda, B., Goswami, P. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2018. Lecture Notes in Computer Science(), vol 10743. Springer, Cham. https://doi.org/10.1007/978-3-319-74180-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-74180-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74179-6
Online ISBN: 978-3-319-74180-2
eBook Packages: Computer ScienceComputer Science (R0)