Timeline for Expected halting time for "The 2^n Game" (aka 2048) -- with random moves
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 18, 2014 at 14:40 | comment | added | Douglas Zare | @Stefan Kohl: What I meant was that for fixed $m$, if you take $n$ larger than $m^2+2$, then there is no way to win, and you have to lose before the board sum reaches $2^{m^2+2}$. | |
| Mar 18, 2014 at 11:39 | comment | added | Stefan Kohl♦ | No -- in case $n < m^2$ you cannot argue in this way. | |
| Mar 18, 2014 at 3:48 | history | edited | Douglas Zare | CC BY-SA 3.0 |
added 9 characters in body
|
| Mar 18, 2014 at 3:41 | history | answered | Douglas Zare | CC BY-SA 3.0 |