  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 this game was raised in the '90s by Goldstein and Reingold. We prove
that the game is hard for PSPACE.
