Game tree search algorithms for the game of cops and robber
Carsten Moldenhauer · ERA: Education and Research Archive (University of Alberta) · 2009
Moving target search has been given much attention during the last twenty years. It is a game in which multiple pursuers (cops) try to catch an evading agent (robber) and also known as the game of cops and robber. Within this thesis we study a discrete alternating version played on a graph with given initial positions for the cops and the robber, providing a number of results for optimal and sub-optimal approaches to the game.