Editing Combinatorial game theory (section)

==See also==
* [[Alpha–beta pruning]], an optimised algorithm for searching the game tree
* [[Backward induction]], reasoning backwards from a final situation
* [[Cooling and heating (combinatorial game theory)]], various transformations of games making them more amenable to the theory
* [[Connection game]], a type of game where players attempt to establish connections
* [[Endgame tablebase]], a database saying how to play endgames
* [[Expectiminimax tree]], an adaptation of a minimax game tree to games with an element of chance
* [[Extensive-form game]], a game tree enriched with payoffs and information available to players
* [[Game classification]], an article discussing ways of classifying games
* [[Game complexity]], an article describing ways of measuring the complexity of games
* [[Grundy's game]], a mathematical game in which heaps of objects are split
* [[Multi-agent system]], a type of computer system for tackling complex problems
* [[Positional game]], a type of game where players claim previously-unclaimed positions
* [[Solving chess]]
* [[Sylver coinage]], a mathematical game of choosing positive integers that are not the sum of non-negative multiples of previously chosen integers
* [[Wythoff's game]], a mathematical game of taking objects from one or two piles
* [[Topological game]], a type of mathematical game played in a topological space
* [[Zugzwang]], being obliged to play when this is disadvantageous