Timeline for Difficulty of 3-color forest Hackenbush
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2022 at 16:32 | answer | added | Gro-Tsen | timeline score: 1 | |
| Apr 13, 2017 at 22:49 | comment | added | Gro-Tsen | @GabrielC.Drummond-Cole Thank you for these comments: this clarifies the situation considerably (the presentation in Winning Ways was not exactly enlightening to me as it is written). | |
| Apr 13, 2017 at 21:40 | comment | added | Gabriel C. Drummond-Cole | (adding to my first comment) moreover the colon principle says that each of the connected components of the red-blue layers can be taken to be a string. | |
| Apr 13, 2017 at 15:03 | comment | added | Gabriel C. Drummond-Cole | And then if you care mostly about outcome classes, atomic weight theory gives you a pretty good working knowledge of how to analyze forests where the green layer is nonempty in every tree (albeit that's not going to give you exact values). | |
| Apr 13, 2017 at 14:56 | comment | added | Gabriel C. Drummond-Cole | According to p. 198 of Winning Ways v. 1, $1:(*:G+H)=1:H+*:G$ which together with the colon principle means that it suffices to understand forests of "two-layer" trees where the layer closer to the root is pure green and the layer further from the root is pure red-blue. | |
| Apr 13, 2017 at 14:04 | history | asked | Gro-Tsen | CC BY-SA 3.0 |