Combinatorial game theory

Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information. Research in this field has primarily focused on two-player games in which a position evolves through alternating moves, each governed by well-defined rules, with the aim of achieving a specific winning condition. Unlike economic game theory, combinatorial game theory generally avoids the study of games of chance or games involving imperfect information, preferring instead games in which the current state and the full set of available moves are always known to both players. However, as mathematical techniques develop, the scope of analyzable games expands, and the boundaries of the field continue to evolve. Authors typically define the term "game" at the outset of academic papers, with definitions tailored to the specific game under analysis rather than reflecting the field's full scope. Combinatorial games include well-known examples such as chess, checkers, and Go, which are considered complex and non-trivial, as well as simpler, "solved" games like tic-tac-toe. Some combinatorial games, such as infinite chess, may feature an unbounded playing area. In the context of combinatorial game theory, the structure of such games is typically modeled using a game tree. The field also encompasses single-player puzzles like Sudoku, and zero-player automata such as Conway's Game of Life—although these are sometimes more accurately categorized as mathematical puzzles or automata, given that the strictest definitions of "game" imply the involvement of multiple participants. A key concept in combinatorial game theory is that of the solved game. For instance, tic-tac-toe is solved in that optimal play by both participants always results in a draw. Determining such outcomes for more complex games is significantly more difficult. Notably, in 2007, checkers was announced to be weakly solved, with perfect play by both sides leading to a draw;...