Timeline for What is a description of winning strategies in this tile game?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 18, 2013 at 12:16 | history | edited | David Hill | CC BY-SA 3.0 |
added 323 characters in body
|
| Sep 17, 2013 at 20:54 | comment | added | Steven Stadnicki | Note that restricting player 1 to a permutation of $0\ldots n-1$ doesn't work either; they can just choose $n-1$ (forcing player 2 to go to the edge of the board), $3$, $n-2$. | |
| Sep 17, 2013 at 19:38 | history | answered | David Hill | CC BY-SA 3.0 |