In combinatorial game theory, normal play is the convention that the player with no legal move on their turn loses. When play terminates after a move, the player making that move wins. In a disjunctive sum of games, a move consists of moving in exactly one component. For finite impartial games under normal play, the nim-value of the sum is the bitwise exclusive OR of the component nim-values.
Normal Play
See also
Combinatorial Game Theory, Impartial Game, Misère-Form Game, Nim-ValueExplore with Wolfram|Alpha
References
Conway, J. H. On Numbers and Games, 2nd ed. Wellesley, MA: A K Peters, 2000.Cite this as:
Weisstein, Eric W. "Normal Play." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/NormalPlay.html