A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges in turns. The cops win the game if they can move onto the robber's vertex. In the standard formulation, it is assumed that the players can "see" each other at all times. A graph G is called cop-win if a single cop can capture the robber on G. We study the effect of reducing the cop's visibility. On the positive side,doi:10.1016/j.tcs.2008.02.041 fatcat:72u2kfpsgfbulihadd2hym77ca