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, cooling, heating, and overheating are operations on hot games to make them more amenable to the traditional methods of the...

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...

was combinatorial game theory. Their books in this area included Mathematical Go: Chilling Gets the Last Point (1994), The Dots and Boxes Game: Sophisticated...

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...

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

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

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...

In combinatorial game theory, a branch of mathematics, a loopy game is one in which a previous state is reachable from descendent options. By contrast...

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...

the theory of repeated games. One of the central theorems in this theory, the folk theorem, relies on the minimax values. In combinatorial game theory, there...

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...

volume introduces combinatorial game theory and its foundation in the surreal numbers; partizan and impartial games; Sprague–Grundy theory and misère 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...

Combinatorial Games: Tic-Tac-Toe Theory is a monograph on the mathematics of tic-tac-toe and other positional games, written by József Beck. It was published...

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...

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

In combinatorial game theory, a fuzzy game is a game which is incomparable with the zero game: it is not greater than 0, which would be a win for Left;...

computational complexity theory of solving logic puzzles and making optimal decisions in two-player and multi-player combinatorial games. Its focus is on...

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

(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...

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...

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

that involve removing tokens (game pieces or stones) from heaps of tokens. They have been studied in combinatorial game theory as a generalization of Nim...

Introduction to Combinatorial Game Theory, A K Peters Ltd, pp. 3–4, ISBN 978-1-56881-277-9 Beck, József (2008). Combinatorial Games: Tic-Tac-Toe Theory. Cambridge...

e., gets erased). According to the normal play convention of combinatorial game theory, the first player who is unable to move loses. Hackenbush boards...