Search results

==Pursuit–evasion game== Consider the [[pursuit–evasion]] game on an <math>8\times 8</math> queen's graph played according to the f ...

...ee.nd.edu/MED10/pdf/477.pdf |first=Meir |last=Pachter |title=Simple-motion pursuit–evasion differential games |year=2002 |archive-date=July 20, 2011 |archive-url=http [[Category:Pursuit–evasion]] ...

...at suffices to ensure a win (i.e., a capture of the robber) in a certain [[pursuit–evasion]] game on the graph. [[Category:Pursuit–evasion]] ...

{{Short description|Type of graph related to pursuit–evasion}} ...' is an [[undirected graph]] on which the pursuer (cop) can always win a [[pursuit–evasion]] game against a robber, with the players taking alternating turns in which ...

[[Category:Pursuit–evasion]] ...

...y)|paths]], as [[Haven (graph theory)|haven]]s describing strategies for [[pursuit–evasion]] games on the graph, or (in the case of locally finite graphs) as [[end (t ...ape police who land at set <math>X_i</math> in round <math>i</math> of the pursuit–evasion game.</ref> Two rays are equivalent if and only if they define the same hav ...