Papers
Topics
Authors
Recent
Search
2000 character limit reached

Invertibility modulo dead-ending no-P-universes

Published 4 Sep 2015 in cs.DM | (1509.01576v1)

Abstract: In normal version of combinatorial game theory, all games are invertible, whereas only the empty game is invertible in mis`ere version. For this reason, several restricted universes were earlier considered for their study, in which more games are invertible. We here study combinatorial games in mis`ere version, 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 Q_Z, and show that all sums of universes whose quotient is Q_Z also have Q_Z as their quotient.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.