Combinatorial Game Theory

Combinatorial game theory is a mathematical theory that can solve difficult Go endgame problems. It deals with exact counting and determining the values of moves, which can be much more complicated than one might think. This theory has a branch called thermography, which is useful for playing endgames well with only a moderate amount of analysis. It also clarifies the meaning of sente and gote.

News

Games of no Chance 3

Some Background

John Conway, Elwyn Berlekamp, and Richard Guy are the founders of Combinatorial Game Theory.
Wikipedia introduction, references, etc.
Aaron Siegel's CGSuite is a very powerful open-source program for research in combinatorial game theory.
David Wolfe has written a C library for combinatorial games and late Go endgames, which is used in our program Explorer to solve Go endgames. David's combinatorial game theory page has more good links.
The combinatorial game theory page of David Eppstein features an overview on combinatorial game theory and many good links.

My Research related to Combinatorial Game Theory

My research interest is efficient algorithms for combinatorial games.

Created on or before: Dec 23, 1997 Last modified: Jun 19, 2009

Martin Müller