Difference between revisions of "Combinatorial game theory"
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 50: | Line 50: | ||
* [[Mathematics]] | * [[Mathematics]] | ||
* [[Multi-agent system]] | * [[Multi-agent system]] | ||
| + | * [[Nimber]] | ||
* [[Perfect information (game theory)]] | * [[Perfect information (game theory)]] | ||
* [[Sylver coinage]] | * [[Sylver coinage]] | ||
Latest revision as of 08:09, 2 November 2016
Combinatorial game theory (CGT) is a branch of applied mathematics and theoretical computer science that typically studies sequential games with perfect information.
Contents
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
- Alpha-beta pruning
- Automaton
- Backward induction
- Checkers
- Chess
- Connection game
- Conway's Game of Life
- Game
- Expectiminimax tree
- Extensive-form game
- Game classification
- Game of chance
- Game theory
- Game tree
- Go
- Grundy's game
- Mathematics
- Multi-agent system
- Nimber
- Perfect information (game theory)
- Sylver coinage
- Wythoff's game
- Topological game
- Zugzwang
External links
- Combinatorial game theory @ Wikipedia
