Re: [math-fun] Double moves

Ha. Reminds me of the paradox of the symmetric random walk on the integers: The expected number of returns to the origin is infinite, but the expected time between one return and the next is also infinite. (Cf. Feller, vol. 1.) --Dan

On Jan 1, 2015, at 1:34 PM, Adam P. Goucher <apgoucher@gmx.com> wrote:

And of course there's the famous `checkmate in omega moves' scenario, where Alice can ensure that Bob eventually loses (after finite time), but for any N it is possible for Bob to ensure he survives for at least N iterations.

(c.f. the MathOverflow post entitled `checkmate in omega moves' and accompanying paper by Joel David Hamkins)