Timeline for A game on integers
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2022 at 21:42 | history | edited | Joel David Hamkins |
edited tags
|
|
| S May 6, 2018 at 9:09 | history | suggested | Maxime Ramzi |
Added the new tag "infinite-games"
|
|
| May 6, 2018 at 8:32 | review | Suggested edits | |||
| S May 6, 2018 at 9:09 | |||||
| Apr 21, 2018 at 10:49 | vote | accept | Haoran Chen | ||
| Apr 10, 2018 at 12:47 | history | edited | Haoran Chen | CC BY-SA 3.0 |
added 49 characters in body
|
| Apr 10, 2018 at 12:44 | comment | added | Haoran Chen | @JoelDavidHamkins I mean $k$ is a fixed integer and I am asking for a strategy that $A$ wins after a finite number of turns. Sorry for the confusion. | |
| Apr 9, 2018 at 7:50 | answer | added | Aaron Meyerowitz | timeline score: 4 | |
| Apr 9, 2018 at 2:48 | comment | added | fedja | I guess a small modification of my argument in mathoverflow.net/questions/129345/n-in-a-row-game-on-mathbbr2/… would show that A has a winning strategy, though I would still prefer to see a more explicit approach (but without using nuclear weapons, of course). | |
| S Apr 8, 2018 at 10:12 | history | suggested | Rodrigo de Azevedo | CC BY-SA 3.0 |
Minor improvements
|
| Apr 8, 2018 at 9:07 | review | Suggested edits | |||
| S Apr 8, 2018 at 10:12 | |||||
| Apr 8, 2018 at 3:45 | answer | added | Aaron Meyerowitz | timeline score: 12 | |
| Apr 8, 2018 at 2:54 | comment | added | Joel David Hamkins | @HarryAltman Yes, I also thought so. But I find myself unsettled when something like that is left unsettled. About your question on the length of the game, I had interpreted the game as having length $\omega$, as in the usual Gale Stewart type analysis, but it seems that my answer shows that player A can force a win at a finite stage of play. | |
| Apr 8, 2018 at 2:37 | answer | added | Joel David Hamkins | timeline score: 65 | |
| Apr 8, 2018 at 2:31 | comment | added | Harry Altman | Joel David Hamkins: The question "Does it depend on $k$?" would seem to suggest that $k$ is a parameter to be fixed in advance. | |
| Apr 8, 2018 at 2:30 | comment | added | Harry Altman | I'm a little unclear on the ending condition. Does the game end in victory for B after $\omega$ turns, or does the game continue until it is impossible for a player to pick (at which point B wins), or what? | |
| Apr 8, 2018 at 2:26 | comment | added | Joel David Hamkins | Could you clarify whether $k$ is fixed in advance for each play of the game? If not, it seems that B can easily win. So I guess you mean that it is fixed. | |
| Apr 8, 2018 at 2:14 | review | First posts | |||
| Apr 8, 2018 at 3:03 | |||||
| Apr 8, 2018 at 2:10 | history | asked | Haoran Chen | CC BY-SA 3.0 |