Related papers: Hunter & Mole
A gambler moves on the vertices $1, \ldots, n$ of a graph using the probability distribution $p_{1}, \ldots, p_{n}$. A cop pursues the gambler on the graph, only being able to move between adjacent vertices. What is the expected number of…
We consider the cops and robber game variant consisting of one cop and one robber on time-varying graphs (TVG). The considered TVGs are edge periodic graphs, i.e., for each edge, a binary string $s_e$ determines in which time step the edge…
We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds…
In the game of \emph{cops and robbers} on a graph $G = (V,E)$, $k$ cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber's turn, he moves similarly. The cops win if there is…
We survey results at the intersection of topological graph theory and the game of Cops and Robbers, focusing on results, conjectures, and open problems for the cop number of a graph embedded on a surface. After a discussion on results for…
We compare two kinds of pursuit-evasion games played on graphs. In Cops and Robbers, the cops can move strategically to adjacent vertices as they please, while in a new variant, called deterministic Zombies and Survivors, the zombies (the…
Cops and Robbers games have been studied for the last few decades in computer science and mathematics. As in general pursuit evasion games, pursuers (cops) seek to capture evaders (robbers); however, players move in turn and are constrained…
Snake is a classic computer game, which has been around for decades. Based on this game, we study the game of Snake on arbitrary undirected graphs. A snake forms a simple path that has to move to an apple while avoiding colliding with…
Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph, where a group of cops tries to capture the robber. The \emph{cop number} of a graph is the minimum number of cops required to capture the robber.…
We explore a variant of the game of Cops and Robber introduced by Bonato et al.~where the robber is invisible unless outside the common neighbourhood of the cops. The hyperopic cop number is analogous to the cop number and we investigate…
We provide a game theoretic framework for the game of cops and robbers (CR). Within this framework we study certain assumptions which underlie the concepts of optimal strategies and capture time. We also point out a connection of these…
In the cops and robber game, there are multiple cops and a single robber taking turns moving along the edges of a graph. The goal of the cops is to capture the robber (move to the same vertex as the robber) and the goal of the robber is to…
We introduce the game of Cat Herding, where an omnipresent herder slowly cuts down a graph until an evasive cat player has nowhere to go. The number of cuts made is the score of a game, and we study the score under optimal play. In this…
We show that the expected time for a smart "cop" to catch a drunk "robber" on an $n$-vertex graph is at most $n + {\rm o}(n)$. More precisely, let $G$ be a simple, connected, undirected graph with distinguished points $u$ and $v$ among its…
We consider a variant of Cops and Robbers in which both the cops and the robber are allowed to traverse up to $s$ edges on each of their turns, where $s \ge 2$. We give several general for this new model as well as establish bounds for the…
The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each…
We consider a variant of a pursuit and evasion game studied independently by Britnell and Wildon as well as Haslegrave. In their game, a cat has to catch an invisible mouse that moves along the edges of some graph $G$. In our version, the…
We investigate a cops and robber game on directed graphs, where the robber moves along the arcs of the graph, while the cops can select any position at each time step. Our main focus is on the cop number: the minimum number of cops required…
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and later the robber chooses a vertex. The cops and robbers make…
(abstract shortened to meet arxiv's length requirements) We investigate two variants of the classical Cops and robber game in graphs, recently introduced by Lee, Mart\'inez-Pedroza, and Rodr\'iguez-Quinche. The two versions are played in…