Misère canonical forms of partizan games
Aaron N. Siegel · arXiv (Cornell University) · 2007
We show that partizan games admit canonical forms in misère play. The proof is a synthesis of the canonical form theorems for normal-play partizan games and misère-play impartial games. It is fully constructive, and algorithms readily emerge for comparing misère games and calculating their canonical forms. We use these techniques to show that there are precisely 256 games born by day 2, and to obtain a bound on the number of games born by day 3.