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 = \left \{ \mathcal{G}^L|\mathcal{G}^R \right \}$$

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

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