Variations of cops and robbers game on grids
From MaRDI portal
Publication:5919113
DOI10.1016/j.dam.2020.02.004zbMath1471.91048OpenAlexW3010184021MaRDI QIDQ5919113
Sandip Das, Harmender Gahlawat
Publication date: 21 October 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.02.004
2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lazy Cops and Robbers on generalized hypercubes
- A cops and robber game in multidimensional grids
- The complexity of pursuit on a graph
- A game of cops and robbers
- Graph searching and a min-max theorem for tree-width
- A game of cops and robbers played on products of graphs
- Game of cops and robbers in oriented quotients of the integer grid
- Vertex-to-vertex pursuit in a graph
- Cops and robbers is EXPTIME-complete
- Pursuing a fast robber on a graph
- Lazy Cops and Robbers on Hypercubes
- Randomized Pursuit-Evasion with Local Visibility
- Variations of cops and robbers game on grids
This page was built for publication: Variations of cops and robbers game on grids