Reproducing the k-copwin Algorithm: Theory vs. Implementation

Cops and Robbers is a well-studied pursuit-evasion game that provides insights into graph theory and theoretical computing.

A central question is determining the minimum number of cops required to capture the robber, known as the cop number.

We focus on reproducing an algorithm proposed by Petr, Portier, and Versteegen in 2022, which efficiently determines whether a graph is $k$-copwin.

This paper presents a Python implementation of the $k$-copwin algorithm.

In this work, we present our implementation in detail, clarify key aspects of the algorithm, and discuss its implications for future practical deployments.