Cops and Robbers on Toroidal Chess Graphs
Allyson Hahn, Neil R. Nicholson

TL;DR
This paper studies various versions of the Cops and Robbers game played on toroidal chess graphs, determining the cop number for each variant based on different chess piece movements.
Contribution
It provides a complete determination of the cop number for multiple Cops and Robbers variants on toroidal chess graphs with different piece-move rules.
Findings
Cop number fully determined for each variant
Different chess piece moves affect cop number
Game variants on toroidal graphs analyzed
Abstract
We investigate multiple variants of the game Cops and Robbers. Playing it on an toroidal chess graph, the game is varied by defining moves for cops and robbers differently, always mimicking moves of certain chess pieces. In these cases, the cop number is completely determined.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Markov Chains and Monte Carlo Methods · Advanced Graph Theory Research
