Misère Games and Misère Quotients

These notes are based on a short course offered at the Weizmann Institute of Science in Rehovot, Israel, in November 2006. The notes include an introduction to impartial games, starting from the beginning; the basic misère quotient construction; a proof of the Guy–Smith–Plambeck Periodicity Theorem; and statements of some recent results and open problems in the subject. First and foremost, I wish to thank the scribes for the course: Taub. I also wish to thank Professor Aviezri Fraenkel for inviting me to the Weizmann Institute and suggesting this course, and thereby making these notes possible. Finally, I wish to thank Thane Plambeck, for recognizing the importance of misère quotients and inventing this beautiful and fascinating theory.

[1]  Aaron N. Siegel,et al.  Misère quotients for impartial games , 2006, J. Comb. Theory, Ser. A.

[2]  P. M. Grundy,et al.  Disjunctive games with the last player losing , 1956, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  C. L. Bouton Nim, A Game with a Complete Mathematical Theory , 1901 .

[4]  L. Rédei,et al.  The theory of finitely generated commutative semigroups , 1965 .

[5]  Thane E. Plambeck,et al.  Taming the wild in impartial combinatorial games , 2005 .

[6]  Thane E. Plambeck,et al.  or Advances in Losing , 2006, math/0603027.

[7]  Cedric A. B. Smith,et al.  The G-values of various games , 1956, Mathematical Proceedings of the Cambridge Philosophical Society.