On the computational complexity of a game of cops and robbers

Authors:
Marcello Mamino
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2013

Citing 5
Cited 1

Regular Article: On the Cop Number of a Graph

Advances in Applied Mathematics
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Pursuing a fast robber on a graph

Theoretical Computer Science
Cops and Robber Game Without Recharging

Theory of Computing Systems
To satisfy impatient web surfers is hard

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms

The guarding game is E-complete

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the computational complexity of a perfect-information two-player game proposed by Aigner and Fromme (1984) [1]. The game takes place on an undirected graph where n simultaneously moving cops attempt to capture a single robber, all moving at the same speed. The players are allowed to pick their starting positions at the first move. The question of the computational complexity of deciding this game was raised by Goldstein and Reingold (1995) [9]. We prove that the game is hard for PSPACE.