Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
PSPACE-completeness of the Hunters and Rabbit game
Walid Ben-Ameur, Alessandro Maddaloni
In the Hunters and Rabbit game, hunters shoot at a set of vertices at each round, while an invisible rabbit must move along an edge. We prove that deciding whether a given number o…
cs.CC2024
Complexity results for a cops and robber game on directed graphs
Walid Ben-Ameur, Alessandro Maddaloni
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 foc…