Combinatorial game theory
All families · 7 solved · 0 open · 0 engines
Solved
Section titled “Solved”| Game | Result under perfect play | Strength | Method | Year | Source |
|---|---|---|---|---|---|
| Nim | First player wins | Strong | Mathematical proof | 1901 | Bouton 1901 |
| Wythoff’s game | First player wins | Strong | Mathematical proof | 1907 | Wythoff 1907 |
| Sim | Second player wins | Strong | Brute-force enumeration | 1974 | Mead et al. 1974 |
| Pentominoes (two-player) | First player wins | Weak | Brute-force enumeration | 1996 | Orman 1996 |
| Dots and Boxes | First player wins | Weak | Alpha-beta + DB | 2014 | Fraser 2014* |
| Amazons (small boards) | First player wins | Weak | Alpha-beta + DB | 2015 | Song et al. 2015 |
| Domineering | First player wins | Weak | Alpha-beta + DB | 2016 | Uiterwijk 2016 |
* Self-archived: the result is available only from its authors (a repository, a post, a deposit), not yet refereed, formally verified or reproduced by someone else. The mark comes off when one of those happens. It applies to this repo’s own results too.