The discrete evasion game with three-move lag

The discrete evasion game with three-move lag, formulated over 30 years ago, was one of the earliest games with time-lag complications. This game remains unsolved even though it is well known that the game has a value. In this article the authors obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known.