Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information...

In combinatorial game theory, a branch of mathematics, a hot game is one in which each player can improve their position by making the next move. By contrast...

In combinatorial game theory, a game is partisan (sometimes partizan) if it is not impartial. That is, some moves are available to one player and not...

In combinatorial game theory, star, written as ∗ or ∗1, is the value given to the game where both players have only the option of moving to the zero game...

Combinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position)...

function contains only terms whose exponent is an odd number. In combinatorial game theory, an evil number is a number that has an even number of 1's in...

of Mancala are relatively basic, the game can be rigorously analyzed through the lens of combinatorial game theory.[citation needed] Mathematical games...

a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics, and philosophy for minimizing the possible loss...

In the context of combinatorial game theory, a game tree is a graph representing all possible game states within a sequential game that has perfect information...

codes and the Thue-Morse-Hedlund sequence". Journal of Combinatorial Mathematics and Combinatorial Computing. 11. Naval Postgraduate School, Department...

printf(" : %d\n", j); z[j++] = i; } } } The theory of lexicographic codes is closely connected to combinatorial game theory. In particular, the codewords in a...

Mathematics portal Combinatorial biology Combinatorial chemistry Combinatorial data analysis Combinatorial game theory Combinatorial group theory Discrete mathematics...

In combinatorial game theory, cooling, heating, and overheating are operations on hot games to make them more amenable to the traditional methods of the...

In combinatorial game theory, an impartial game is a game in which the allowable moves depend only on the position and not on which of the two players...

element of chance; solving such a game may use combinatorial game theory or computer assistance. A two-player game can be solved on several levels: Prove...

In combinatorial game theory, the Sprague–Grundy theorem states that every impartial game under the normal play convention is equivalent to a one-heap...

(non-well-founded) sets in this way. Any combinatorial game, can be associated with a rooted directed graph whose vertices are game positions, whose edges are moves...

Hearn, Robert (2001). "Playing Games with Algorithms: Algorithmic Combinatorial Game Theory". arXiv:cs/0106019v2. Winning Ways: 2 [1] Col and Snort games...

In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to the way its combinatorics depends on input, constraints...

volume introduces combinatorial game theory and its foundation in the surreal numbers; partizan and impartial games; Sprague–Grundy theory and misère games...

turns tapping one hand against another. Chopsticks is an example of a combinatorial game, and is solved in the sense that with perfect play, an optimal strategy...

ko rules), Quixo, and checkers are EXPTIME-complete. Game complexity Combinatorial game theory Reisch, Stefan (1981), "Hex ist PSPACE-vollständig", Acta...

In game theory, a focal point (or Schelling point) is a solution that people tend to choose by default in the absence of communication in order to avoid...

mathematician. He was active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He also made contributions...

numerous checkers through intentionally "poor" play. In combinatorial game theory, a misère game is one played according to the "misère play condition";...

In combinatorial game theory, poset games are mathematical games of strategy, generalizing many well-known games such as Nim and Chomp. In such games...

Nim is a mathematical combinatorial game in which two players take turns removing (or "nimming") objects from distinct heaps or piles. On each turn, a...

In combinatorial game theory, the zero game is the game where neither player has any legal options. Therefore, under the normal play convention, the first...

Analysis of "pure" abstract strategy games is the subject of combinatorial game theory. Abstract strategy games with hidden information, bluffing, or...

In game theory, the outcome of a game is the ultimate result of a strategic interaction with one or more people, dependant on the choices made by all participants...