Bouton’s theorem

E1702627 UNEXPLORED

Bouton’s theorem is a fundamental result in combinatorial game theory that characterizes winning and losing positions in the game of Nim using binary (xor) addition of heap sizes.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Bouton’s theorem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Nim → hasSolutionDescribedIn → Bouton’s theorem ⓘ