Timeline for A Game with Strings and Coins
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2019 at 21:11 | comment | added | user3294068 | Another explanation. There are 12 "rooms", areas surrounded by string. Each cut to a wall of a room reduces the number of rooms (merges two rooms or opens one to the outside), but drops no coins. Once there are no rooms left, the next cut droms coins. Thus, there are 12 safe moves and the 13th move loses. | |
| Mar 29, 2015 at 22:17 | comment | added | xnor | @randal'thor Nope, but I was familiar with all the needed graph-theory facts about trees. | |
| Mar 29, 2015 at 22:16 | comment | added | Rand al'Thor | I'm impressed you solved this so fast! Had you seen it (or an equivalent puzzle) before? | |
| Mar 29, 2015 at 22:12 | vote | accept | Mike Earnest | ||
| Mar 29, 2015 at 22:09 | history | answered | xnor | CC BY-SA 3.0 |