Indistinguishability quotient
In combinatorial game theory, and particularly in the theory of impartial games in misère play, an indistinguishability quotient is a commutative monoid that generalizes and localizes the Sprague–Grundy theorem for a specific game's rule set. In the specific case of misere-play impartial games, such commutative monoids have become known as misere quotients.
Source: Wikipedia — Indistinguishability quotient (CC BY-SA 4.0)