Binary dicots, a core of dicot games

Abstract

We study combinatorial games under misère convention. Several sets of games have been considered earlier to better understand the behaviour of misère games. We here connect several of these sets. In particular, we prove that comparison modulo binary dicot games is often the same as comparison modulo dicot games, and that equivalence modulo dicot games and modulo impartial games are the same when they are restricted to impartial games.

References in corpus (3)

• Taming the wild in impartial combinatorial games
• Misère canonical forms of partizan games
• Misère-play Hackenbush Sprigs