Combinatorial game theory
Combinatorial game theory (CGT) is a branch of applied mathematics and theoretical computer science that typically studies sequential games with perfect information.
(TO DO: expand, organize, cross-reference, illustrate.)
Description
CGT is largely confined to [two-player games which have a position in which the players take turns changing in defined ways or moves to achieve a defined winning condition.
CGT has not traditionally studied games randomness and imperfect or incomplete information (sometimes called games of chance, like poker), favoring games whose position is public to both players, and in which the set of available moves is also public (perfect information).
Examples
Combinatorial games include well-known games like chess, checkers, Go, Arimaa, Hex, and Connect6. They also include one-player combinatorial puzzles, and even no-player automata, like Conway's Game of Life.
Game tree
In CGT, the moves in these games are represented as a game tree.
See also
External links
- Combinatorial game theory @ Wikipedia
