On the Number of Pursuers That Guarantees the Capture of the Evader in a Game on the Graph of Icosahedral Edges

We study how the optimal number of pursuers in a differential game on a graph changes when an edge is removed from the graph. It is shown that, when one edge of an icosahedron is removed, two pursuers are sufficient to capture the evader, whereas, for the icosahedron itself, this number is 3.

Ҳали таржима қилинмаган