We introduce two variations of the cops and robber game on graphs. These games yield two invariants in $\mathbb{Z}_+\cup\{\infty\}$ for any connected graph $Γ$, the {weak cop number $\mathsf{wcop}(Γ)$} and the {strong cop number $\mathsf{scop}(Γ)$}. These invariants satisfy that $\mathsf{scop}(Γ)\leq\mathsf{wcop}(Γ)$. Any graph that is finite or a tree has strong cop number one. These new invariants are preserved under small local perturbations of the graph, specifically, both the weak and strong cop numbers are quasi-isometric invariants of connected graphs. More generally, we prove that if $Δ$ is a quasi-retract of $Γ$ then $\mathsf{wcop}(Δ)\leq\mathsf{wcop}(Γ)$ and $\mathsf{scop}(Δ)\leq\mathsf{scop}(Γ)$. We exhibit families of examples of graphs with arbitrary weak cop number (resp. strong cop number). We prove that hyperbolic graphs have strong cop number one. We also prove that one-ended non-amenable locally-finite vertex-transitive graphs have infinite weak cop number. We raise the question of whether there exists a connected vertex transitive graph with finite weak (resp. strong) cop number different than one.