On the computational complexity of a game of cops and robbers

Details On the computational complexity of a game of cops and robbers On the computational complexity of a game of cops and robbers

2012-02-27

arxiv.org/abs/1202.6043v1

Computer Science

Computational Complexity

14 pages, 2 figures

Scientific paper

We study the computational complexity of a perfect-information two-player game proposed by Aigner and Fromme. 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 what player has a winning strategy in an instance of this game was raised in the '90s by Goldstein and Reingold. We prove that the game is hard for PSPACE.

Affiliated with

Also associated with

No associations

Rating

On the computational complexity of a game of cops and robbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the computational complexity of a game of cops and robbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the computational complexity of a game of cops and robbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605032