  The 'Cheating Robot' version of Cops and Robbers is played on a finite,
simple, connected graph. The players move in the same time period. However,
before moving, the robot observes to which vertices the cops are moving and it
is fast enough to complete its move in the time period. The cops also know that
the robot will use this information. More cops are required to capture a robot
than to capture a robber. Indeed, the minimum degree is a lower bound on the
number of cops required to capture a robot. Only on a tree is one cop
guaranteed to capture a robot, although two cops are sufficient to capture both
a robber and a robot on outerplanar graphs. In graphs where retracts are
involved, we show how cop strategies against a robber can be modified to
capture a robot. This approach gives exact numbers for hypercubes, and
$k$-dimensional grids in general.
