Warming (combinatorial Game Theory)

In combinatorial game theory, cooling, heating, and overheating are operations on hot games to make them more amenable to the traditional methods of the theory,
which was originally devised for cold games in which the winner is the last player to have a legal move.
Overheating was generalised by Elwyn Berlekamp.
Chilling (or unheating) and warming are variants used in the analysis of the endgame of Go.

Cooling and chilling may be thought of as a tax on the player who moves, making them pay for the privilege of doing so,
while heating, warming and overheating are operations that more or less reverse cooling and chilling.

Basic operations: cooling, heating

The cooled game $G_t$ ("$G$ cooled by $t$") for a game $G$ and a (surreal) number $t$ is defined by
:: $G_t = \begin \ & \text t \leq \text \tau \text G_\tau \text m \text\\ m & \text t > \tau \end$.
The amount $t$ by which $G$ is cooled is known as the ''temperature''; the minimum $\tau$ for which $G_\tau$ is infinitesimally close to $m$ is known as the ''temperature'' $t(G)$ ''of'' $G$; $G$ is said to ''freeze'' to $G_\tau$; $m$ is the ''mean value'' (or simply ''mean'') of $G$.

Heating is the inverse of cooling and is defined as the "''integral''"
:: $\int^t G = \begin G & \text G \text \\ \ & \text \end$

Multiplication and overheating

Norton multiplication is an extension of multiplication to a game $G$ and a positive game $U$ (the "unit")
defined by
:: $G.U = \begin G \times U & \text G \text U \text G \text \\ -G \times -U & \text G \text \\ \ \text I \text \Delta (U) & \text \end$
The incentives $\Delta (U)$ of a game $U$ are defined as $\ \cup \$.

Overheating is an extension of heating used in Berlekamp's solution of Blockbusting,
where $G$ ''overheated from'' $s$ ''to'' $t$ is defined for arbitrary games $G, s, t$ with $s > 0$ as
:: $\int_s^t G = \begin G . s & \text G \text \\ \ & \text \end$

'' Winning Ways'' also defines overheating of a game $G$ by a positive game $X$, as
:: $\int_0^t G = \left\$
: Note that in this definition numbers are not treated differently from arbitrary games.
: Note that the "lower bound" 0 distinguishes this from the previous definition by Berlekamp

Operations for Go: chilling and warming

Chilling is a variant of cooling by $1$ used to analyse the Go endgame of Go and is defined by
:: $f(G) = \begin m & \text G \text m \text m *, \\ \ & \text \end$
This is equivalent to cooling by $1$ when $G$ is an "even elementary Go position in canonical form".

Warming is a special case of overheating, namely $\int_^1$, normally written simply as $\int$ which inverts chilling when $G$ is an "even elementary Go position in canonical form".
In this case the previous definition simplifies to the formBerlekamp & Wolfe (1994), pp. 52–55
:: $\int G = \begin G & \text G \text \\ G * & \text G \text \\ \ & \text \end$

References

Combinatorial game theory

{{combin-stub