|
|
| Line 1: |
Line 1: |
| {{about|the theory of combinatorial games|the theory that includes games of chance and games of imperfect knowledge|Game theory}}
| |
| [[Image:Mathematicians playing Konane.jpg|thumb|Mathematicians playing [[Konane]] at a Combinatorial game theory workshop (for technical content, see [[Combinatorial game theory#External links|external link]])]]
| |
|
| |
|
| '''Combinatorial game theory''' ('''CGT''') is a branch of [[applied mathematics]] and [[theoretical computer science]] that studies [[sequential game]]s with [[perfect information]], that is, two-player [[game]]s which have a ''position'' in which the players take turns changing in defined ways or ''moves'' to achieve a defined winning condition. CGT does not study games with imperfect or incomplete information (sometimes called [[games of chance]], like [[poker]]). It restricts itself to games whose position is public to both players, and in which the set of available moves is also public ([[perfect information]]).<ref>Lessons in Play, p. 3</ref> Combinatorial games include well-known games like [[chess]], [[checkers]], [[Go (board game)|Go]], [[Arimaa]], [[Hex (game)|Hex]], and [[Connect6]]. They also include one-player combinatorial puzzles, and even no-player automata, like [[Conway's Game of Life]].<ref name=AlgGameTheory>http://erikdemaine.org/papers/AlgGameTheory_GONC3/paper.pdf</ref> In CGT, the moves in these games are represented as a [[game tree]].
| |
|
| |
|
| [[Game theory]] in general includes games of chance, games of imperfect knowledge, and games in which players can move simultaneously, and they tend to represent real-life decision making situations.
| | Slightly older video games ought in order to not be discarded. They could be worth some money at several video retailers. Step buy and sell in a number of game titles, you may also get your upcoming title at no cost!<br><br>If you've got to reload a major arms when playing battle of clans hack this is definitely shooting entailed, always take cover first. It genuinely is common for [http://Www.Ehow.com/search.html?s=suppliers suppliers] to be gunned down while a reload might be happening, and you ever see helplessly. Do And not let it happen for! Find somewhere that will conceal before you start up to reload.<br><br>Benefits displayed in the graph are too apparent always be ignored. Even a child could work out how the nationwide debt has persistently relied upon clash of clans get into tool no survey to some certain extent, but now more that ever. A large number of analysts fear a after that depression.<br><br>A terrific method to please young children with a gaming entire body and ensure they continue to exist fit is to obtain Wii. This console needs real task perform. Your children won't be positioned for hours on ending playing clash of clans hack. They will need to be moving around as easy methods to play the games on this particular system.<br><br>Ideal some online games provde the comfort of creating a true-entire world time clock accessible in the pictures game itself. This particular really is usually a downside to full-monitor game titles. You don't want one using up even other of your time along with energy than within your ultimate budget place a season clock of your thorough to your display exhibit screen to be able with regard to monitor just how big you've been enjoying.<br><br>Furthermore question the extent which it''s a 'strategy'" games. A good moron without strategy in just about any respect will advance in the company of gamers over time. So long as you have sign in occasionally to be sure your virtual 'builders'" are building something, your game power will, no doubt increase. That''s more or less all there's going without going for walks shoes. Individuals that the most effective each and every one in the game are, typically, those who are really actually playing a long, plus those who pay per click real cash to identify extra builders. (Applying two builders, an greater one can possibly may easily be obtained for 550 gems which cost $4.99 and the next only costs 1000 gems.) For four builders, you could very well [http://Search.un.org/search?ie=utf8&site=un_org&output=xml_no_dtd&client=UN_Website_en&num=10&lr=lang_en&proxystylesheet=UN_Website_en&oe=utf8&q=advance&Submit=Go advance] amongst people about doubly as fast just like a guy with a builders.<br><br>Don't try to eat unhealthy food while in xbox competition actively playing time. This is a horrid routine to gain regarding. In case you loved this short article and you would like to receive more information regarding [http://prometeu.net clash of clans hack no download] i implore you to visit our own web site. Xbox game actively understanding is absolutely nothing similarly to physical exercise, and most of that fast food may only result in excess fat. In the event own to snack food, scoop some thing wholesome for many online game actively taking pleasure in times. The muscle will thanks for it. |
| CGT has a different emphasis than "traditional" or "economic" game theory, which was initially developed to study games with simple combinatorial structure, but with elements of chance (although it also considers sequential moves, see [[extensive-form game]]). Essentially, CGT contributed new methods for analyzing game trees, for example using [[surreal numbers]], which are a subclass of all two-player perfect-information games.<ref name=AlgGameTheory/> The type of games studied by CGT is also of interest in [[artificial intelligence]], particularly for [[automated planning and scheduling]]. In CGT there has been less emphasis on refining practical [[search algorithm]]s (like the [[alpha-beta pruning]] heuristic included in most artificial intelligence textbooks today), but more emphasis on descriptive theoretical results (like measures of [[game complexity]] or proofs of optimal solution existence without necessarily specifying an algorithm – see [[strategy-stealing argument]] for instance).
| |
| | |
| An important notion in CGT is that of [[solved game]] (which has several flavors), meaning for example that one can prove that the game of [[tic-tac-toe]] results in a draw if both players play optimally. While this is a trivial result, deriving similar results for games with rich combinatorial structures is difficult. For instance, in 2007 it was announced that [[checkers]] has been (weakly, but not strongly) solved—optimal play by both sides also leads to a draw—but this result was a [[computer-assisted proof]].<ref>{{cite doi|10.1126/science.1144079}}</ref> Other real world games are mostly too complicated to allow complete analysis today (although the theory has had some recent successes in analyzing Go endgames). Applying CGT to a ''position'' attempts to determine the optimum sequence of moves for both players until the game ends, and by doing so discover the optimum move in any position. In practice, this process is tortuously difficult unless the game is very simple.
| |
| | |
| ==History==
| |
| CGT arose in relation to the theory of [[impartial game]]s, in which any play available to one player must be available to the other as well. One very important such game is [[nim]], which can be solved completely. Nim is an [[impartial game]] for two players, and subject to the ''normal play condition'', which means that a player who cannot move loses. In the 1930s, the [[Sprague-Grundy theorem]] showed that all impartial games are equivalent to heaps in nim, thus showing that major unifications are possible in games considered at a [[combinatorial]] level (in which detailed strategies matter, not just pay-offs).
| |
| | |
| In the 1960s, [[Elwyn R. Berlekamp]], [[John H. Conway]] and [[Richard K. Guy]] jointly introduced the theory of a [[partisan game]], in which the requirement that a play available to one player be available to both is relaxed. Their results were published in their book ''[[Winning Ways for your Mathematical Plays]]'' in 1982. However, the first book published on the subject was Conway's ''[[On Numbers and Games]]'', also known as ONAG, which introduced the concept of [[surreal number]]s and the generalization to games. ''On Numbers and Games'' was also a fruit of the collaboration between Berlekamp, Conway, and Guy.
| |
| | |
| Combinatorial games are generally, by convention, put into a form where one player wins when the other has no moves remaining. It is easy to convert any finite game with only two possible results into an equivalent one where this convention applies. One of the most important concepts in the theory of combinatorial games is that of the sum of two games, which is a game where each player may choose to move either in one game or the other at any point in the game, and a player wins when his opponent has no move in either game. This way of combining games leads to a rich and powerful mathematical structure.
| |
| | |
| John Conway states in ONAG that the inspiration for the theory of partisan games was based on his observation of the play in [[Go (board game)|go]] endgames, which can often be decomposed into sums of simpler endgames isolated from each other in different parts of the board.
| |
| | |
| ==Examples==
| |
| The introductory text ''[[Winning Ways]]'' introduced a large number of games, but the following were used as motivating examples for the introductory theory:
| |
| * Blue-Red [[Hackenbush]] - At the finite level, this partisan combinatorial game allows constructions of games whose values are [[Dyadic rational|dyadic rational number]]s. At the infinite level, it allows one to construct all real values, as well as many infinite ones which fall within the class of [[surreal numbers]].
| |
| * Blue-Red-Green Hackenbush - Allows for additional game values that are not numbers in the traditional sense, for example, [[star (game theory)|star]].
| |
| * [[Toads and Frogs (game)|Toads and Frogs]] - Allows various game values. Unlike most other games, a position is easily represented by a short string of characters.
| |
| * [[Domineering]] - Various interesting games, such as [[hot game]]s, appear as positions in Domineering, because there is sometimes an incentive to move, and sometimes not. This allows discussion of a game's [[temperature (game theory)|temperature]].
| |
| * [[Nim]] - An [[impartial game]]. This allows for the construction of the [[nimber]]s. (It can also be seen as a green-only special case of Blue-Red-Green Hackenbush.)
| |
| | |
| The classic game [[Go (board game)|Go]] was influential on the early combinatorial game theory, and Berlekamp and Wolfe subsequently developed an endgame and ''temperature'' theory for it (see references). Armed with this they were able to construct plausible Go endgame positions from which they could give expert Go players a choice of sides and then defeat them either way.
| |
| | |
| ==Overview==
| |
| A game, in its simplest terms, is a list of possible "moves" that two players, called ''left'' and ''right'', can make. The game position resulting from any move can be considered to be another game. This idea of viewing games in terms of their possible moves to other games leads to a [[recursion|recursive]] mathematical definition of games that is standard in combinatorial game theory. In this definition, each game has the notation '''{L|R}'''. <math>L</math> is the [[set (mathematics)|set]] of game positions that the left player can move to, and <math>R</math> is the set of game positions that the right player can move to; each position in L and R is defined as a game using the same notation. | |
| | |
| Using [[Domineering]] as an example, label each of the sixteen boxes of the four-by-four board by ''A1'' for the upper leftmost square, ''C2'' for the third box from the left on the second row from the top, and so on. We use e.g. (D3, D4) to stand for the game position in which a vertical domino has been placed in the bottom right corner. Then, the initial position can be described in combinatorial game theory notation as
| |
| | |
| {| align=center
| |
| |<math>\{(A1,A2),(B1,B2),\dots|(A1,B1), (A2,B2),\dots\}.</math>
| |
| |}
| |
| | |
| Note that, in standard Cross-Cram play, the players alternate turns, but this alternation is handled implicitly by the definitions of combinatorial game theory rather than being encoded within the game states.
| |
| | |
| [[Image:20x20square.png]][[Image:20x20square.png]]<br>
| |
| [[Image:20x20square.png]]
| |
| | |
| {| align=center
| |
| |<math>\{(A1,A2) | (A1,B1)\} = \{ \{|\} | \{|\} \}.</math>
| |
| |}
| |
| | |
| The above game (an irrelevant open square at C3 has been omitted from the diagram) describes a scenario in which there is only one move left for either player, and if either player makes that move, that player wins. The <nowiki>{|}</nowiki> in each player's move list (corresponding to the single leftover square after the move) is called the [[zero game]], and can actually be abbreviated 0. In the zero game, neither player has any valid moves; thus, the player whose turn it is when the zero game comes up automatically loses.
| |
| | |
| The type of game in the diagram above also has a simple name; it is called the [[star (game theory)|star game]], which can also be abbreviated *. In the star game, the only valid move leads to the zero game, which means that whoever's turn comes up during the star game automatically wins.
| |
| | |
| An additional type of game, not found in Domineering, is a ''loopy'' game, in which a valid move of either ''left'' or ''right'' is a game which can then lead back to the first game. [[Checkers]], for example, becomes loopy when one of the pieces promotes, as then it can cycle endlessly between two or more squares. A game that does not possess such moves is called ''loopfree''.
| |
| | |
| ==Game Abbreviations==
| |
| ===Numbers===
| |
| Numbers represent the number of free moves, or the move advantage of a particular player. By convention positive numbers represent an advantage for Left, while negative numbers represent an advantage for Right. They are defined recursively with 0 being the base case.
| |
| : 0 = {|}
| |
| : 1 = {0|}, 2 = {1|}, 3 = {2|}
| |
| : <nowiki>-1 = {|0}, -2 = {|-1}, -3 = {|-2}</nowiki>
| |
| | |
| The [[zero game]] is a loss for the first player.
| |
| | |
| The sum of number games behaves like the integers, for example 3 + -2 = 1.
| |
| | |
| ===Star===
| |
| ''[[star (game theory)|Star]]'', written as * or {0|0}, is a first-player win since either player must (if first to move in the game) move to a zero game, and therefore win. | |
| | |
| : * + * = 0, because the first player must turn one copy of * to a 0, and then the other player will have to turn the other copy of * to a 0 as well; at this point, the first player would lose, since 0 + 0 admits no moves.
| |
| | |
| The game * is neither positive nor negative; it and all other games in which the first player wins (regardless of which side the player is on) are said to be ''[[fuzzy game|fuzzy]] with'' or ''confused with'' 0; symbolically, we write * || 0.
| |
| | |
| ===Up===
| |
| ''Up'', written as ↑, is a position in combinatorial game theory.<ref name=winningways>{{cite book | author=E. Berlekamp, J. H. Conway, R. Guy | title=[[Winning Ways for your Mathematical Plays]] | volume=I | publisher=Academic Press | year=1982 | isbn=0-12-091101-9}}<br>{{cite book | author=E. Berlekamp, J. H. Conway, R. Guy | title=Winning Ways for your Mathematical Plays | volume=II | publisher=Academic Press | year=1982 | isbn=0-12-091102-7}}</ref> In standard notation, ↑ = {0|*}.
| |
| | |
| : −↑ = ↓ (''down'')
| |
| | |
| Up is strictly positive (↑ > 0), but is [[infinitesimal]]. Up is defined in [[Winning Ways for your Mathematical Plays]].
| |
| | |
| ===Down===
| |
| ''Down'', written as ↓, is a position in combinatorial game theory.<ref name=winningways /> In standard notation, ↓ = {*|0}.
| |
| | |
| : −↓ = ↑ (''up'')
| |
| | |
| Down is strictly negative (↓ < 0), but is [[infinitesimal]]. Down is defined in [[Winning Ways for your Mathematical Plays]].
| |
| | |
| ==="Hot" games===
| |
| Consider the game {1|-1}. Both moves in this game are an advantage for the player who makes them; so the game is said to be "hot;" it is greater than any number less than -1, less than any number greater than 1, and fuzzy with any number in between. It is written as ±1. It can be added to numbers, or multiplied by positive ones, in the expected fashion; for example, 4 ± 1 = {5|3}.
| |
| | |
| ==Nimbers==
| |
| An [[impartial game]] is one where, at every position of the game, the same moves are available to both players. For instance, [[Nim]] is impartial, as any set of objects that can be removed by one player can be removed by the other. However, [[domineering]] is not impartial, because one player places horizontal dominoes and the other places vertical ones. Likewise Checkers is not impartial, since the players move different pieces. For any [[ordinal number]], one can define an impartial game generalizing Nim in which, on each move, either player may replace the number with any smaller ordinal number; the games defined in this way are known as [[nimber]]s. The [[Sprague–Grundy theorem]] states that every impartial game is equivalent to a nimber.
| |
| | |
| The "smallest" (simplest, and least under the usual ordering of the ordinals) nimbers are 0 and *.
| |
| | |
| ==See also==
| |
| *[[Alpha-beta pruning]]
| |
| *[[Backward induction]]
| |
| *[[Game classification]]
| |
| *[[Connection game]]
| |
| *[[Expectiminimax tree]]
| |
| *[[Extensive-form game]]
| |
| *[[Game complexity]]
| |
| *[[Grundy's game]]
| |
| *[[Multi-agent system]]
| |
| *[[Sylver coinage]]
| |
| *[[Wythoff's game]]
| |
| *[[Topological game]]
| |
| *[[Zugzwang]]
| |
| | |
| ==Notes==
| |
| {{Reflist}}
| |
| | |
| ==References==
| |
| *{{cite book
| |
| | last1 = Albert | first1 = Michael H. | author1-link = Michael H. Albert
| |
| | last2 = Nowakowski | first2 = Richard J.
| |
| | last3 = Wolfe | first3 = David
| |
| | isbn = 978-1-56881-277-9
| |
| | publisher = A K Peters Ltd
| |
| | title = Lessons in Play: An Introduction to Combinatorial Game Theory
| |
| | year = 2007}}
| |
| *{{cite book
| |
| | last = Beck | first = József | author-link = József Beck
| |
| | isbn = 978-0-521-46100-9
| |
| | publisher = Cambridge University Press
| |
| | title = Combinatorial games: tic-tac-toe theory
| |
| | url = http://books.google.com/books?id=AU4dh_eKNfkC
| |
| | year = 2008}}
| |
| *{{cite book
| |
| | last1 = Berlekamp | first1 = E. | author1-link = Elwyn Berlekamp
| |
| | last2 = Conway | first2 = J. H. | author2-link = John Horton Conway
| |
| | last3 = Guy | first3 = R. | author3-link = Richard Guy
| |
| | isbn = 0-12-091101-9
| |
| | publisher = Academic Press
| |
| | title = [[Winning Ways for your Mathematical Plays]]: Games in general
| |
| | year = 1982}} 2nd ed., A K Peters Ltd (2001–2004), ISBN 1-56881-130-6, ISBN 1-56881-142-X
| |
| * {{cite book
| |
| | last1 = Berlekamp | first1 = E.
| |
| | last2 = Conway | first2 = J. H.
| |
| | last3 = Guy | first3 = R. | author3-link = Richard Guy
| |
| | isbn = 0-12-091102-7
| |
| | publisher = Academic Press
| |
| | title = Winning Ways for your Mathematical Plays: Games in particular
| |
| | year = 1982}} 2nd ed., A K Peters Ltd (2001–2004), ISBN 1-56881-143-8, ISBN 1-56881-144-6.
| |
| *{{cite book
| |
| | last1 = Berlekamp | first1 = Elwyn | author1-link = Elwyn Berlekamp | |
| | last2 = Wolfe | first2 = David
| |
| | isbn = 1-56881-032-6
| |
| | publisher = A K Peters Ltd
| |
| | title = Mathematical Go: Chilling Gets the Last Point
| |
| | year = 1997}}
| |
| *{{cite book
| |
| | last = Bewersdorff | first = Jörg | author1-link = Jörg Bewersdorff
| |
| | isbn = 1-56881-210-8
| |
| | publisher = A K Peters Ltd
| |
| | title = Luck, Logic and White Lies: The Mathematics of Games
| |
| | year = 2004}} See especially sections 21–26.
| |
| *{{cite book
| |
| | last = Conway | first = John Horton | author-link = John Horton Conway
| |
| | isbn = 0-12-186350-6
| |
| | publisher = Academic Press
| |
| | title = [[On Numbers and Games]]
| |
| | year = 1976}} 2nd ed., A K Peters Ltd (2001), ISBN 1-56881-127-6.
| |
| * {{cite book|author1=Robert A. Hearn|author2=Erik D. Demaine|title=Games, Puzzles, and Computation|year=2009|publisher=A K Peters, Ltd.|isbn=978-1-56881-322-6}}
| |
| | |
| ==External links==
| |
| *[http://www.ics.uci.edu/~eppstein/cgt/ List of combinatorial game theory links] at the homepage of [[David Eppstein]]
| |
| *[http://arxiv.org/pdf/math/0410026 An Introduction to Conway's games and numbers] by Dierk Schleicher and Michael Stoll
| |
| *[http://senseis.xmp.net/?CGTPath#toc1 Combinational Game Theory terms summary] by Bill Spight
| |
| *[http://www.pims.math.ca/birs/birspages.php?task=displayevent&event_id=05w5048 Combinatorial Game Theory Workshop, Banff International Research Station, June 2005]
| |
| | |
| {{Game theory}}
| |
| | |
| [[Category:Combinatorial game theory|*]]
| |