Winning Concurrent Reachability Games Requires Doubly-Exponential Patience
Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen · 2009
We exhibit a deterministic concurrent reachability game PURGATORY$_n$ with $n$ non-terminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given $\epsilon