Cops and robber game without recharging

  • Authors:

  • Fedor V. Fomin;Petr A. Golovach;Daniel Lokshtanov

  • Affiliations:

  • Department of Informatics, University of Bergen, Bergen, Norway;School of Engineering and Computing Sciences, Durham University, Durham, UK;Department of Informatics, University of Bergen, Bergen, Norway

  • Venue:
  • SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cops & Robber is a classical pursuit-evasion game on undirected graphs, where the task is to identify the minimum number of cops sufficient to catch the robber. In this work, we consider a natural variant of this game, where every cop can make at most f steps, and prove that for each f≥2, it is PSPACE-complete to decide whether k cops can capture the robber.