Finding a princess in a palace: a pursuit-evasion problem

zbMath1266.05097arXiv1204.5490MaRDI QIDQ1953406

John R. Britnell, Mark Wildon

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

pursuit-evasioncombinatorial search

Mathematics Subject Classification ID

Trees (05C05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

Hunting rabbits on the hypercube ⋮ Approximately locating an invisible agent in a graph with relative distance queries ⋮ Searching for an intruder on graphs and their subdivisions ⋮ Locating a robber with multiple probes ⋮ How to hunt an invisible rabbit on a graph ⋮ On Evasion Games on Graphs ⋮ The cat and the noisy mouse

This page was built for publication: Finding a princess in a palace: a pursuit-evasion problem