Combinatorial Game Theory: Hackenbush, Part 2 (Advanced Concepts)

Added:

Classical Game Theory and Heuristic Decision-Making

While Combinatorial Game Theory (CGT) provides an elegant algebraic framework for analyzing deterministic, perfect-information games using surreal numbers, it is often contrasted with Classical Game Theory and heuristic artificial intelligence. Mainstream economists and decision theorists argue that CGT's strict assumptions—such as perfect information, no elements of chance, and the 'normal play' convention—render it impractical for modeling real-world human behavior, economics, or biology, where uncertainty and simultaneous moves prevail. These fields instead rely on Classical Game Theory (von Neumann-Morgenstern), which utilizes utility maximization and mixed strategies. Furthermore, from a computational standpoint, calculating exact CGT values like infinitesimals in complex game states is often computationally intractable (frequently NP-hard). Consequently, practical computer science favors heuristic search algorithms, probabilistic models, and deep learning over the exact, algebraic reductions of Hackenbush.

Basic rules of Hackenbush (Part 1), including Blue-Red Hackenbush, stalks, and graph representation.
Fundamental concepts of Combinatorial Game Theory (CGT), such as partisan games, normal play convention, and Left/Right options.
The concept of game values and simple number values (integers and dyadic rationals like 1/2 or -1/4) representing game states.
Basic mathematical set theory and recursive definitions, which are essential for understanding game construction.
Surreal Number Theory and its algebraic structure, including transfinite numbers and field properties.
The analysis of other partisan games (like Domineering or Toads-and-Frogs) using infinitesimals, up-arrows (↑), and down-arrows (↓).
Temperature Theory and Thermography in CGT to evaluate 'hot' games where players have a strong incentive to move.
The Sprague-Grundy Theorem and impartial game theory, comparing partisan games to games like Nim.
Computational complexity of games, examining the algorithmic difficulty (e.g., NP-hardness) of solving generalized Hackenbush configurations.
427 views4likes52:18@USFMathematicsGraduateSeminarOriginal Release: 2023-10-23

Combinatorial game theory extends beyond surreal numbers to include games with infinite and infinitesimal values, such as the game 'Over' (an infinite number of red stalks on a blue branch) which is greater than any finite multiple of Up but less than all positive infinite surreal numbers, and 'Tiny' games which are smaller than any other positive game value, demonstrating that the class of all games forms a larger structure than the surreal numbers.