Difference between revisions of "Combinatorial game theory"
Karl Jones (Talk | contribs) (etc) |
Karl Jones (Talk | contribs) |
||
| Line 1: | Line 1: | ||
'''Combinatorial game theory''' ('''CGT''') is a branch of applied [[mathematics]] and theoretical [[computer science]] that typically studies sequential games with perfect information. | '''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. | 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. | ||
| Line 5: | Line 7: | ||
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). | 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). | ||
| − | 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]]. | + | 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]]. |
In CGT, the moves in these games are represented as a [[game tree]]. | In CGT, the moves in these games are represented as a [[game tree]]. | ||
| Line 11: | Line 13: | ||
== See also == | == See also == | ||
| + | * [[Automata]] | ||
| + | * [[Checkers]] | ||
| + | * [[Chess]] | ||
| + | * [[Conway's Game of Life]] | ||
| + | * [[Game]] | ||
* [[Game theory]] | * [[Game theory]] | ||
| + | * [[Game tree]] | ||
| + | * [[Go]] | ||
| + | * [[Mathematics]] | ||
== External links == | == External links == | ||
* [http://en.wikipedia.org/wiki/Combinatorial_game_theory Combinatorial game theory] @ Wikipedia | * [http://en.wikipedia.org/wiki/Combinatorial_game_theory Combinatorial game theory] @ Wikipedia | ||
Revision as of 06:01, 3 September 2015
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.
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).
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.
In CGT, the moves in these games are represented as a game tree.
See also
External links
- Combinatorial game theory @ Wikipedia
