Timeline for Study of Hex on the Torus
Current License: CC BY-SA 3.0
13 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 27, 2018 at 14:08 | vote | accept | Christopher King | ||
Sep 27, 2017 at 15:46 | answer | added | john mangual | timeline score: 1 | |
Sep 27, 2017 at 15:17 | history | edited | Christopher King |
edited tags
|
|
Sep 27, 2017 at 6:35 | answer | added | Will Sawin | timeline score: 3 | |
Sep 27, 2017 at 6:17 | comment | added | Will Sawin | @PyRulez A tie is only forced if both players have a loop not in the set. | |
Sep 27, 2017 at 0:06 | comment | added | Christopher King | @StevenStadnicki one option would be to assign (1,0) and opposite signed loops to Alice and (0,1) and same signed loops to Bob. | |
Sep 27, 2017 at 0:05 | comment | added | Christopher King | @StevenStadnicki that's why I was talking about sets of loops. You basically need to partition the set of loops without the null loop. If you don't, and a player achieves a loop not in the sets, it will definitely be a tie. | |
Sep 27, 2017 at 0:03 | comment | added | Steven Stadnicki | There are infinitely many different homotopy classes of loops on the torus. I presume you're thinking about what could be called (1,0)- and (0,1)-loops, but what if a player achieves e.g. a (1,1)-loop? | |
Sep 26, 2017 at 23:15 | comment | added | j.c. | I agree that I was wrong about the strategy stealing argument, I edited my comment just as you were replying. | |
Sep 26, 2017 at 23:13 | comment | added | Christopher King | @j.c. not necessarily. You have to prove there are no ties first. Also, I included those tags since loop equivalence is usually studied in those fields, but if you don't think they fit, that's okay. | |
Sep 26, 2017 at 23:11 | comment | added | j.c. | I removed the "general topology" and "homotopy theory" tags as this question doesn't really fall under those fields. | |
Sep 26, 2017 at 23:06 | history | edited | j.c. | CC BY-SA 3.0 |
edit tags, fix sentence fragment.
|
Sep 26, 2017 at 22:06 | history | asked | Christopher King | CC BY-SA 3.0 |