RUS  ENG
Full version
JOURNALS // Moscow Mathematical Journal // Archive

Mosc. Math. J., 2006 Volume 6, Number 2, Pages 359–388 (Mi mmj251)

This article is cited in 10 papers

An introduction to Conway's games and numbers

D. Schleicher, M. Stoll

International University Bremen

Abstract: This note attempts to furnish John H. Conway's combinatorial game theory with an introduction that is easily accessible and yet mathematically precise and self-contained and which provides complete statements and proofs for some of the folklore in the subject.
Conway's theory is a fascinating and rich theory based on a simple and intuitive recursive definition of games, which yields a very rich algebraic structure. Games form an abelian GROUP in a very natural way. A certain subgroup of games, called numbers, is a FIELD that contains both the real numbers and the ordinal numbers. Conway's theory is deeply satisfying from a theoretical point of view, and at the same time it has useful applications to specific games such as Go.

Key words and phrases: Conway game, surreal number, combinatorial game theory.

MSC: 91-02, 91A05, 91A46, 91A70

Received: November 14, 2004

Language: English

DOI: 10.17323/1609-4514-2006-6-2-359-388



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026