This book is a state-of-the-art look at combinatorial games, that is, games not involving chance or hidden information. It contains articles by some of the foremost researchers and pioneers of combinatorial game theory, such as Elwyn Berlekamp and John Conway, by other researchers in mathematics and computer science, and by top game players. The articles run the gamut from new theoretical approaches (infinite games, generalizations of game values, two-player cellular automata, alpha-beta pruning under partial orders) to the very latest in some of the hottest games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with an updated bibliography by A. Fraenkel and an updated version of the famous annotated list of combinatorial game theory problems by R. K. Guy, now in collaboration with R. J. Nowakowski.