Combinatorial Games. - 43

Based on lectures presented at the AMS Short Course on Combinatorial Games, held at the Joint Mathematics Meetings in Columbus in August 1990, the ten papers in this volume will provide readers with insight into this exciting field. Because the book requires very little background, it will likely find a wide audience that includes the amateur interested in playing games, the undergraduate looking for a new area of study, instructors seeking a refreshing area in which to give new courses at both the undergraduate and graduate levels, and graduate students looking for a variety of research topics.In the opening paper, Guy contrasts combinatorial games, which have complete information and no chance moves, with those of classical game theory.

Conway introduces a new theory of numbers, including infinitesimals and transfinite numbers, which has emerged as a special case of the theory of games.

Guy describes impartial games, with the same options for both players, and the Sprague-Grundy theory.

Conway discusses a variety of ways in which games can be played simultaneously.

Berlekamp uses the theory of 'hot' games to make remarkable progress in the analysis of Go Endgames.Pless demonstrates the close connection between several impartial games and error-correcting codes.

Fraenkel explains the way in which complexity theory is very well illustrated by combinatorial games, which supply a plethora of examples of harder problems than most of those which have been considered in the past.

Nowakowski outlines the theory of three particular games - Welter's Game, Sylver Coinage, and Dots-and-Boxes.

A list of three dozen open problems and a bibliography of 400 items are appended.