In the classical cops and robbers game, cops chase a robber on a graph, taking turns moving along edges. The cop number — the minimum number of cops needed to guarantee capture — is a fundamental graph invariant. But it's fragile: small changes to the graph can change the cop number, and the invariant doesn't respect topological equivalence between graphs.
Bapat et al. (arXiv:2603.13192) modify the rules. In their “Sneaky-Active” variant, everyone must move on every turn (no waiting), and the robber can pass through a cop's position without being captured — only staying on a cop's vertex after movement counts as caught. The robber is sneakier; the cops must be more coordinated.
The payoff: the Sneaky-Active cop number is invariant under ×-homotopy equivalence. Graphs that are topologically equivalent in the categorical product sense have the same cop number. The game becomes a topological invariant, not just a combinatorial one.
On reflexive graphs (where every vertex has a self-loop, meaning “stay in place” is always an option), the Sneaky-Active game reduces to the classical game. The new variant isn't a different game on familiar graphs — it's the same game, extended to a setting where it gains topological meaning.
The deeper observation: the classical cop number fails to be a homotopy invariant because staying in place breaks the topological structure. When you force movement, you align the game dynamics with the categorical product's notion of connectivity. The robber passing through cops mirrors the homotopy principle that continuous deformations can pass through intermediate states.
Making the game harder (the robber is sneakier) makes the mathematics cleaner (the invariant respects topology). Constraints produce structure.