Description
This book is a compilation of research on combinatorial games, which are games that do not involve chance or hidden information. The book contains articles by some of the top names in the field, as well as other researchers in mathematics and computer science. Many of the advances in the field reflect the interaction between computer science and mathematics. The book also includes an updated bibliography and an annotated list of combinatorial game theory problems.
This book is a state-of-the-art look at combinatorial games, that is, games not involving chance or hidden information. It contains a fascinating collection of articles by some of the top names in the field, such as Elwyn Berlekamp and John Conway, plus other researchers in mathematics and computer science, together with some top game players. The articles run the gamut from new theoretical approaches (infinite games, generalizations of game values, 2-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 and annotated list of combinatorial game theory problems by R. K. Guy.
Related Products
