Timeline for Game on a square grid (part II)
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2022 at 11:17 | comment | added | joro | @Eilon Thanks, I am not familiar with this theorem. Yes, I am interested in the winner as n,m vary. If necessary fix m. | |
| Jan 26, 2022 at 15:04 | comment | added | Eilon | So a winning strategy exists by Zermelo's theorem. I guess you are interested in identifying the winner for various n and m. | |
| Jan 25, 2022 at 14:54 | comment | added | joro | @Eilon Alternately, taking turns. Player A starts. | |
| Jan 25, 2022 at 14:36 | comment | added | Eilon | In phase 1, do the players move simultaneously or alternately? | |
| Jan 25, 2022 at 7:13 | comment | added | joro | @GerryMyerson Thanks, you are right. I edited, trying to clarify about two types of moves. | |
| Jan 25, 2022 at 7:12 | history | edited | joro | CC BY-SA 4.0 |
clarified about two phases
|
| Jan 25, 2022 at 5:52 | comment | added | Gerry Myerson | It says a move is coloring a vertex (or more than one vertex?) red, and then it says a move is drawing a line (segment, presumably) between two red vertices. Which is it? | |
| Jan 24, 2022 at 19:03 | comment | added | joro | @Squala You are right, draw is impossible, I edited. | |
| Jan 24, 2022 at 19:02 | history | edited | joro | CC BY-SA 4.0 |
removed draw due to comments
|
| Jan 24, 2022 at 17:53 | comment | added | Squala | why would there ever be no valid moves? | |
| Jan 24, 2022 at 16:07 | history | asked | joro | CC BY-SA 4.0 |