Zero Game

In combinatorial game theory, the term zero game (or simply zero) means any abstract game in which the first player to move loses; all such games are equal (in the CGT sense).

Zero has a canonical form, one that may be reduced no further, which is ``{ | }``. Note that this game has no options, and is therefore a loss for the first player. Of course, zero is also written as ``0``.

See also

• Zero in CGT terms (something of a misnomer, perhaps) — examples of zero games in go
• Abstract game — for basic definitions, and details of the four outcome classes, of which zero is one.