A note on image-cop, image-robber games on graphs Original Research Article

We give an algorithmic characterisation of finite cop-win digraphs. The case of image cops and image robbers is then reduced to the one cop case. Similar characterisations are also possible in many situations where the movements of the cops and/or the robbers are somehow restricted.