Combinatorial game theory

2015-09-19T23:35:24Z

70.75.243.131: I added more of the conditions that combinatorial games must meet.

{{simp|date=December 2011}}
'''Combinatorial game theory''', also known as '''CGT''' is a branch of applied mathematics and theoretical computer science that studies combinatorial games, and is distinct from "traditional" or "economic" [[game theory]]. CGT arose in relation to the theory of impartial games, the two-player game of [[Nim]] in particular, with an emphasis on "solving" certain types of combinatorial games.

A game must meet several [[conditions]] to be a combinatorial game. These are:
#The game must have at least two players.
#The game must be sequential (i.e. Players [[alternate]] turns.)
#The game must have perfect information (i.e. no information is hidden, as in Poker.)
#The game must be deterministic (i.e. non-chance). [[Luck]] is not a part of the game.
#The game must have a defined amount of possible moves.
#The game must eventually end.
#The game must end when one player can no longer move.

Combinatorial Game Theory is largely confined to the study of a subset of combinatorial games which are two player, finite, and have a winner and loser (i.e. do not end in draws.)

These combinatorial games can be represented by trees, each vertex of which is the game resulting from a particular move from the game directly below it on the tree. These games can be assigned game values. Finding these game values is of great interests to CG theorists, as is the theoretical concept of game addition. The sum of two games is the game in which each player on her/his turn must move in only one of the two games, leaving the other as it was.

[[Elwyn Berlekamp]], [[John Conway]] and [[Richard Guy]] are the founders of the theory. They worked together in the [[1960s]]. Their published work was called ''Winning Ways for Your Mathematical Plays''.

==Definitions==

In the theory, there are two players called ''left'' and ''right''. A '''game''' is something that allows left and right to make moves to ''other games''. For example, in the game of [[chess]], there is a usual starting setup. One could also, however, think of a chess game after the first move as a different game, with a different setup. So each position is also called a game.

Games have the notation '''{L|R}'''. <math>L</math> are the games the left player can move to. <math>R</math> are the games the right player can move to. If you know [[chess notation]], then the usual chess setup is the game

{| align=center
|<math>\{a3,a4,Na3,b3,b4,c3,c4,Nc3,\dots|a6,a5,Na6,b6,b5,c6,c5,Nc6,\dots\}</math>
|}

The [[ellipsis|dots]] "..." mean there are many moves, so not all are shown.

Chess is very complex. It is better to think of easier games. Nim, for example, is much simpler to think about. Nim is played like this:
#There are [[zero]] or more piles of [[counter]]s.
#On a turn, a player may take as many counters from one pile as that player wants.
#The player who cannot make a move loses.

The easiest game of Nim starts with no counters at all! In such a case, neither player can move. That is shown as {|}. Both sides are empty, because neither player can move. The first player to go cannot move, and so will lose. In CGT, people often write {|} as the symbol '''0''' (zero).

The next-easiest game has only one pile, with just one counter. If the left player goes first, that player must take the counter, leaving right with no moves ({|}, or 0). If instead right moves first, there will be no more moves for left. So both left and right can make a move to 0. That is shown as <nowiki>{{|}|{|}}, or {0|0}</nowiki>. The first player to move will win. Games equal to {0|0} are very important. They are written with the symbol, '''*''' (star).



[[Category:Game theory]]

TCS Wiki - User contributions [en]

Combinatorial game theory