Abstract
In combinatorial game theory, under normal play convention, all games are invertible, whereas only the empty game is invertible in misère play. For this reason, several restricted universes of games were studied, in which more games are invertible. Here, we study combinatorial games under misère play, in particular universes where no player would like to pass their turn. In these universes, we prove that having one extra condition makes all games become invertible. We then focus our attention on a specific quotient, called \({\mathcal {Q}_{\mathbb {Z}}}\), and show that all sums of universes whose quotient is \({\mathcal {Q}_{\mathbb {Z}}}\) also have \({\mathcal {Q}_{\mathbb {Z}}}\) as their quotient.
Similar content being viewed by others
Notes
By convention, Left is a female player whereas Right is a male player.
A game X is said to be cancellative (modulo \(\mathcal {U}\)) if for all games G and H (in \(\mathcal {U}\)), whenever \(X+G\) and \(X+H\) are equivalent (modulo \(\mathcal {U}\)), then G and H are equivalent (modulo \(\mathcal {U}\)).
References
Albert MH, Nowakowski RJ, Wolfe D (2007) Lessons in play. A K Peters Ltd, Natick
Allen MR (2009) An investigation of Misère Partizan games. PhD Thesis, Dalhousie University
Berlekamp ER, Conway JH (2001) In: Guy RK (ed) Winning ways for your mathematical plays, 2nd edn. A K Peters Ltd, Natick
Conway John H (2001) On numbers and games, 2nd edn. A K Peters Ltd, Natick
Dorbec P, Renault G, Siegel AN, Sopena É (2014) Dicots, and a taxonomic ranking for misère games. Combin. Theory Ser A (to appear in J)
McKay NA, Milley R, Nowakowski RJ (2014) Misère-play hackenbush sprigs. Int J Game Theory. arXiv:1202.5654
Mesdal GA, Ottaway P (2007) Simplification of partizan games in misère play, INTEGERS, 7:#G06, G.A. Mesdal is comprised of M. Allen, J.P. Grossman, A. Hill, N.A. McKay, R.J. Nowakowski, T. Plambeck, A.A. Siegel, D. Wolfe
Milley R (2015) Partizan Kayles and Misère Invertibility. Integers 15:Article G3
Milley R, Nowakowski RJ, Ottaway P (2012) The misère monoid of one-handed alternating games. Integers 12B(#A1)
Milley R, Renault G (2013) Dead ends in misère play: the misère monoid of canonical numbers. Discret Math 313:2223–2231
Plambeck TE (2005) Taming the wild in impartial combinatorial games, INTEGERS, 5:#G5, 36 pp. Comb, Games Sect
Plambeck TE, Siegel AN (2008) Misere quotients for impartial games. J Combin Theory Ser A 115(4):593–622
Renault G (2013) Combinatorial games on graphs. PhD Thesis, Université de Bordeaux
Siegel AN. Misère canonical forms of partizan games. arxiv preprint arXiv:math/0703565
Siegel AN. Personal communication
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the ANR-14-CE25-0006 project of the French National Research Agency.
Rights and permissions
About this article
Cite this article
Renault, G. Invertibility modulo dead-ending no-\(\mathcal {P}\)-universes. Int J Game Theory 47, 797–809 (2018). https://doi.org/10.1007/s00182-018-0629-7
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00182-018-0629-7