Timeline for Topological Subset Take-Away
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 13, 2015 at 4:20 | history | edited | user62675 |
edited tags
|
|
| Aug 12, 2015 at 18:16 | comment | added | Jeremy Rickard | I think everybody will realize, but it might be a good idea to say explicitly that the loser is the first player without a legal move. | |
| Aug 12, 2015 at 8:23 | history | edited | user62675 | CC BY-SA 3.0 |
added 18 characters in body
|
| Aug 12, 2015 at 7:57 | comment | added | Gabriel C. Drummond-Cole | @QiaochuYuan I agree that for this game there is no obvious reason to expect a simple answer, but there are many classes of poset game that do admit simple descriptions of the outcome classes. | |
| Aug 12, 2015 at 7:52 | comment | added | Qiaochu Yuan | This is in turn just a special case of en.wikipedia.org/wiki/Poset_game. Apparently determining the winner of such a game is PSPACE-complete, so there seems to be no reason to expect a simple answer. | |
| Aug 12, 2015 at 7:24 | comment | added | S. Carnahan♦ | I don't see why, in Gale's original game, the same player wins for both $|S|=1$ and $|S|=2$. | |
| Aug 12, 2015 at 6:59 | review | Close votes | |||
| Aug 12, 2015 at 7:25 | |||||
| Aug 12, 2015 at 6:57 | history | edited | user62675 | CC BY-SA 3.0 |
added 38 characters in body
|
| Aug 12, 2015 at 6:23 | history | asked | user62675 | CC BY-SA 3.0 |