Combinatorial game theory

From Wiki @ Karl Jones dot com
Revision as of 05:37, 18 February 2016 by Karl Jones (Talk | contribs) (See also)

Jump to: navigation, search

Combinatorial game theory (CGT) is a branch of applied mathematics and theoretical computer science that typically studies sequential games with perfect information.

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.

Perfect information

CGT favors games whose position is public to both players, and in which the set of available moves is also public (perfect information).

Games of chance

CGT has not traditionally studied games of randomness and imperfect or incomplete information (sometimes called games of chance), such as poker.

Examples

Combinatorial games include well-known games, including:

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