Jump to content

User:Rcaetano

From Wikipedia, the free encyclopedia

This is some test for the Combinatorial Game Theory page.

A game is defined recursively as an ordered pair of sets of games. A game G is denoted by:

where and are sets of games. The set , called the set of Left options, corresponds to the moves available to the Left player. Analogously for .

If neither player has any available move then we have = = , and G