How many zombies are needed to catch the survivor on toroidal grids?

DOI10.1016/j.tcs.2018.05.021zbMath1433.91034arXiv1703.09616OpenAlexW2963841794WikidataQ129793880 ScholiaQ129793880MaRDI QIDQ2328860

Paweł Prałat

Publication date: 16 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.09616

zbMATH Keywords

graphtoroidal grid

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (1)

A note on deterministic zombies

Cites Work

• A deterministic version of the game of zombies and survivors on graphs
• A probabilistic version of the game of zombies and survivors on graphs

This page was built for publication: How many zombies are needed to catch the survivor on toroidal grids?