Sum of Combinatorial Games

In combinatorial game theory, the sum of combinatorial games is a combinatorial game in which two players take turns, on each turn making a move on a single game out of a specified collection of combinatorial games. The new game is said to be a sum of the collection of games.

The sum operation was formalized by Conway (1976). It can be used to give combinatorial games an arithmetic structure that extends the arithmetic of the real numbers (see surreal number) and to model game play in games like Go and Amazons in which late stages of games tend to split up into disconnected regions of the board that do not affect each other.

Famous quotes containing the words sum of, sum and/or games:

    The ornament is a statuette, a black figure of a bird. I am prepared to pay on behalf of the figure’s rightful owner the sum of $5000 for its recovery. I am prepared to promise, to promise ... what is the phrase?—’No questions will be asked.’
    John Huston (1906–1987)

    Society does not consist of individuals but expresses the sum of interrelations, the relations within which these individuals stand.
    Karl Marx (1818–1883)

    Intelligence and war are games, perhaps the only meaningful games left. If any player becomes too proficient, the game is threatened with termination.
    William Burroughs (b. 1914)