Indistinguishability quotient
In combinatorial game theory, and particularly in the theory of impartial games in misère play, an indistinguishability quotient is a commutative monoidthat 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.
primaryTopic
Indistinguishability quotient
In combinatorial game theory, and particularly in the theory of impartial games in misère play, an indistinguishability quotient is a commutative monoidthat 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.
has abstract
In combinatorial game theory, ...... ome known as misere quotients.
@en
Link from a Wikipage to an external page
Wikipage page ID
21,648,167
Wikipage revision ID
730,578,496
subject
comment
In combinatorial game theory, ...... ome known as misere quotients.
@en
label
Indistinguishability quotient
@en