Difference between revisions of "Combinatorial game theory"
Karl Jones (Talk | contribs) (→External links) |
Karl Jones (Talk | contribs) (→External links) |
||
| Line 48: | Line 48: | ||
* [http://en.wikipedia.org/wiki/Combinatorial_game_theory Combinatorial game theory] @ Wikipedia | * [http://en.wikipedia.org/wiki/Combinatorial_game_theory Combinatorial game theory] @ Wikipedia | ||
| − | |||
[[Category:Game theory]] | [[Category:Game theory]] | ||
[[Category:Mathematics]] | [[Category:Mathematics]] | ||
Revision as of 04:19, 21 April 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
- Automata
- Checkers
- Chess
- Conway's Game of Life
- Game
- Game of chance
- Game theory
- Game tree
- Go
- Mathematics
- Perfect information (game theory)
External links
- Combinatorial game theory @ Wikipedia
