THE DISCRETE EVASION GAME
Published Date: August 1, 1974
Theoretical and computational aspects of the three-move discrete evasion game are presented. An evader strategy is given that yields an upper bound of .2890 for the game-value, and a Marksman strategy is given that yields a lower bound .2842. A particular form for the Marksman strategy is presented which depends on r bits of information, and it is proved that this type of strategy is near-optimal. The results are also applied to the two-move game, which was solved earlier by other workers.
