Cops and Robbers on Toroidal Chess Graphs

10/24/2018
by   Allyson Hahn, et al.
0

We investigate multiple variants of the game Cops and Robbers. Playing it on an n × n 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2023

Cops and robber on variants of retracts and subdivisions of oriented graphs

Cops and Robber is one of the most studied two-player pursuit-evasion ga...
research
03/18/2023

Modelling Chess in VDM++

The game of chess is well-known and widely played all over the world. Ho...
research
03/09/2018

Computational Complexity of Generalized Push Fight

We analyze the computational complexity of optimally playing the two-pla...
research
07/22/2020

Differential games, locality and model checking for FO logic of graphs

We introduce differential games for FO logic of graphs, a variant of Ehr...
research
11/03/2021

Transfinite game values in infinite draughts

Infinite draughts, or checkers, is played just like the finite game, but...
research
12/14/2021

Split Moves for Monte-Carlo Tree Search

In many games, moves consist of several decisions made by the player. Th...
research
07/20/2017

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Pebble games are single-player games on DAGs involving placing and movin...

Please sign up or login with your details

Forgot password? Click here to reset