Partizan Combinatorial Game Theory: Introduction to Game Values

Added:

Computational Complexity and Heuristic Valuation

While Partizan Combinatorial Game Theory (CGT) provides an elegant algebraic framework for determining exact game values (such as surreal numbers and infinitesimals), it faces severe limitations in practice due to combinatorial explosion. Calculating exact values for game trees in games like Domineering or Go is often PSPACE-hard, making the algebraic approach intractable for larger, realistic board sizes. Consequently, computer science and artificial intelligence favor an alternative paradigm: heuristic evaluation and probabilistic search (such as Monte Carlo Tree Search and Deep Reinforcement Learning). Instead of computing exact mathematical game values, these systems approximate a position's strength using neural networks and heuristic evaluation functions. This perspective argues that for complex games, exact algebraic valuation is computationally unviable, and that practical decision-making must rely on approximation, bounded rationality, and statistical methods rather than perfect mathematical reduction.

Basic concepts of Combinatorial Game Theory (CGT), including the definition of normal play convention and perfect information.
Understanding of basic game trees and how sequential moves by two players are represented graphically.
Familiarity with basic mathematical set notation, as CGT games are recursively defined using sets of options.
The rules and objective of the grid-shading game 'Domineering' (Left plays vertically, Right plays horizontally).
Game arithmetic, including the addition of games (playing on independent boards simultaneously) and finding the negative of a game.
The classification of game values into numbers (integers and fractions) versus non-numeric values (like fuzzy or confused games).
Understanding infinitesimal values in CGT, such as 'star' (*), 'up' (↑), and 'down' (↓).
John Conway's construction of Surreal Numbers and how they mathematically emerge from partizan game values.
Analyzing and solving complex Domineering board states by decomposing them into independent sum-games.
285 views12likes1:27:53@3cycleOriginal Release: 2025-11-30

Partizan Game Theory studies two-player games of perfect information where players have different available moves (partisan games), using a formal algebraic framework where games can be added, negated, and compared; games are classified by their outcomes (L, R, N, P) and values (positive, negative, zero, or infinitesimal), enabling analysis of complex game positions by decomposing them into simpler components.