User:Rcaetano

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:

$G=\{{{𝒢}}^L|{{𝒢}}^R\}$

where ${{𝒢}}^L$ and ${{𝒢}}^R$ are sets of games. The set ${{𝒢}}^L$, called the set of Left options, corresponds to the moves available to the Left player. Analogously for ${{𝒢}}^R$.

If neither player has any available move then we have ${{𝒢}}^L$ = ${{𝒢}}^R$ = $\varnothing$, and G