2006/09/30 by Thane E. Plambeck, Aaron N. Siegel · 1 citation
Mathematics · #math.CO #math.AC #msc:91A46 #msc:20M14
published as Journal of Combinatorial Theory, Series A (May 2008) pp 593-622 · Paper has been split into two parts: this part, and a supplement at arXiv:0705.2404v1
arxiv created 2007/08/14 · arxiv updated 2009/12/01
We announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also introduce several advances in the structure theory of misere quotients, including a connection between the combinatorial structure of normal and misere play.