Related papers: Hunting a rabbit: complexity, approximability and …
Hunters and Rabbit game is played on a graph $G$ where the Hunter player shoots at $k$ vertices in every round while the Rabbit player occupies an unknown vertex and, if not shot, must move to a neighbouring vertex after each round. The…
We investigate Hunters & Rabbit game, where a set of hunters tries to catch an invisible rabbit that slides along the edges of a graph. We show that the minimum number of hunters required to win on an (n\times m)-grid is \lfloor…
We explore the Hunters and Rabbits game on the hypercube. In the process, we find the solution for all classes of graphs with an isoperimetric nesting property and find the exact hunter number of $Q^n$ to be $1+\sum\limits_{i=0}^{n-2}…
We consider a pursuit-evasion game that describes the process of extinguishing a fire burning on the nodes of an undirected graph. We denote the minimum number of firefighters required by ffn(G) and provide almost sharp bounds to this graph…
Imagine an invisible rabbit that starts at some unknown integer point $A$ on the number line. At each time step, it hops by a fixed but unknown integer stride $B$. Both $A$ and $B$ are fixed integers, but their values are unknown. Suppose…
We analyze the Hunter vs Rabbit game on graph, which is a kind of model of communication in an adhoc mobile network. Let $G$ be a cycle graph with $N$ nodes. The hunter can move from a vertex to another vertex on the graph along an edge.…
In the game of Cops and Robbers, a team of cops attempts to capture a robber on a graph $G$. All players occupy vertices of $G$. The game operates in rounds; in each round the cops move to neighboring vertices, after which the robber does…
Cops and robbers is a turn-based pursuit game played on a graph $G$. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number $c(G)$ denotes the minimum number of…
The hat guessing number $HG(G)$ of a graph $G$ on $n$ vertices is defined in terms of the following game: $n$ players are placed on the $n$ vertices of $G$, each wearing a hat whose color is arbitrarily chosen from a set of $q$ possible…
We study the vertex pursuit game of \emph{Cops and Robbers}, in which cops try to capture a robber on the vertices of the graph. The minimum number of cops required to win on a given graph $G$ is called the cop number of $G$. We focus on…
Given an undirected graph, $G$, and vertices, $s$ and $t$ in $G$, the tracking paths problem is that of finding the smallest subset of vertices in $G$ whose intersection with any $s$-$t$ path results in a unique sequence. This problem is…
We consider a variation of a cops and robbers game in which the cop---here referred to as "hunter"---is not constrained by the graph but must play in the dark against a "mole." We characterize the graphs---which we will call…
Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem…
In the $(s,d)$-spy game over a graph, introduced by Cohen et al. in 2016, one spy and $k$ guards occupy vertices of a graph and, at each turn, each guard may move along one edge and the spy may move along at most $s$ edges. The guards win…
The game of \emph{Cops and Robber} is usually played on a graph, where a group of cops attempt to catch a robber moving along the edges of the graph. The \emph{cop number} of a graph is the minimum number of cops required to win the game.…
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…
The localization game is a two player combinatorial game played on a graph $G=(V,E)$. The cops choose a set of vertices $S_1 \subseteq V$ with $|S_1|=k$. The robber then chooses a vertex $v \in V$ whose location is hidden from the cops, but…
The burning number of a graph $G$ is the smallest number $b$ such that the vertices of $G$ can be covered by balls of radii $0, 1, \dots, b-1$. As computing the burning number of a graph is known to be NP-hard, even on trees, it is natural…
Let $G$ be a graph with $n$ vertices. The {\em hat guessing number} of $G$ is defined in terms of the following game: There are $n$ players and one opponent. The opponent will wear one of the $q$ hats of different colors on the player's…
A generalization of hyperopic cops and robber, analogous to the $k$-visibility cops and robber, is introduced in this paper. For a positive integer $k$ the $k$-hyperopic game of cops and robber is defined similarly as the usual cops and…