On tame, pet, domestic, and miserable impartial games
Playing impartial games under the normal and misere conventions may differ a lot. However, there are also many "exceptions" for which the normal and misere Sprague-Grundy functions are very similar. The first such example, the game Nim, was considered by Bouton as early as in 1901. In 1976 Conway introduced a large class of such games that he called tame games. Here we introduce a proper subclass, pet games, and a proper superclass, domestic games. For each of these three classes we provide efficiently verifiable characterizations. These games are closely related to another important subclass of the tame games introduced in 2007 by the first author and called miserable games. We show that tame, pet, and domestic games turn into miserable games by "slight modifications" of the definitions. We also show that the sum of miserable games is miserable and find several other classes that respect summation. The developed techniques allow us to prove that very many well-known impartial games fall into classes mentioned above. Such examples include all subtraction games, which are pet; game Euclid, which is miserable (and, hence, tame), as well as many versions of the Wythoff game and Nim, which may be miserable, pet, or domestic.