Skip to main content

Variations of Cops and Robbers Game on Grids

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10743))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8, 1–12 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Offner, D., Okajian, K.: Variations of cops and robber on the hypercube. Aust. J. Comb. 59(2), 229–250 (2014)

    MathSciNet  MATH  Google Scholar 

  3. Bal, D., Bonato, A., Kinnersley, W.B., Pralat, P.: Lazy cops and robbers on hypercubes. Comb. Probab. Comput. 24(6), 829–837 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  4. Sim, K.A., Tan, T.S., Wong, K.B.: Lazy cops and robbers on generalized hypercubes. Discrete Math. 340(7), 1693–1704 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fomin, F., Golovach, P., Kratochvil, J., Nisse, N., Suchan, K.: Pursuing a fast robber on a graph. Theor. Comput. Sci. 411, 1167–1181 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Luccio, F., Pagli, L.: Cops and robber on grids and tori. CoRR, abs/1708.08255 (2017)

    Google Scholar 

  7. Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 253–259 (1983)

    MathSciNet  MATH  Google Scholar 

  8. Quillot, P.: A short note about pursuit games payed on a graph of given genus. J. Comb. Theory Ser. B 38, 89–92 (1985)

    Article  Google Scholar 

  9. Goldstein, A.S., Reingold, E.M.: The complexity of pursuit on a graph. Theor. Comput. Sci. 143, 93–112 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bonato, A., Nowakowski, R.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)

    Book  MATH  Google Scholar 

  11. 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

    Chapter  Google Scholar 

  12. Bhattacharya, S., Paul, G., Sanyal, S.: A cops and robber game in multidimensional grids. Discrete Appl. Math. 58, 1745–1751 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, Essex (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Harmender Gahlawat .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics