Photo by mluotio83 from unsplash
A Cop and Drunken Robber (CDR) game is one variation of a famous combinatorial game, called Cops and Robbers, which has been extensively studied and applied in the area of… Click to show full abstract
A Cop and Drunken Robber (CDR) game is one variation of a famous combinatorial game, called Cops and Robbers, which has been extensively studied and applied in the area of theoretical and computer science as demonstrated by several conferences and publications. In this paper, for a natural number n, we present two strategies for a single cop to chase a drunken robber on n-dimensional infinite-grid graphs. Both strategies show that if the initial distance between the cop and the drunken robber is s, then the expected capture time is s+o(s).
Keywords:
game;
drunken robber;
infinite grid;
dimensional infinite;
grid graphs;
cop drunken
Journal Title: Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematics
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!