Combinatorial game theory is a branch of mathematics devoted to studying the optimal strategy in perfect-information games with two or more players (typical), one player (puzzles), or zero players (like Conway's Game of Life).
Related categories 3
A comprehensive bibliography on combinatorial games; several papers about combinatorial games; and information about where to publish such results.
David Eppstein - Combinatorial Game Theory
Many up-to-date links, and a short introduction.
How many ways are there of throwing n indistinguishable dice each with m faces?
Elwyn Berlekamp - Combinatorial Game Theory
Elwyn's research in the field, including several papers.
Erik Demaine's Combinatorial Games
Research on pushing blocks, Clickomania, Phutball, and sliding coins. Survey paper on algorithmic combinatorial game theory.
Includes a complete list of all possible Fair Dice, most of which are not cubes. Includes pictures.
Introductory Combinatorial Game Theory
Description and analysis of several impartial and partial (partisan) combinatorial games by Lim Chu Wee.
Jeff Erickson - Mathematical Games, Toys, and Puzzles
Links to several game theorists and actual games, plus a brief introduction. Also a couple of papers on game theory, about Toads and Frogs and Sowing Games.
John Conway's Game of LIfe
A simple Java implementation of Conway's classic game of life.
Solution of the case of a restricted version called Oddish Phutball by presenting an explicit strategy in terms of a potential function. [PDF]
Phutball Endgames are Hard
Mathematical paper by Erik Demaine, Martin Demaine and David Eppstein on solving the Philosopher's Football game. [PDF]
Last update:December 17, 2011 at 22:22:37 UTC