| More Games of No Chance Contributor(s): Nowakowski, Richard J. (Editor), Levy, Silvio (Editor) |
|
 |
ISBN: 0521808324 ISBN-13: 9780521808323 Publisher: Cambridge University Press OUR PRICE: $171.00 Product Type: Hardcover Published: November 2002 Annotation: This is a state-of-the-art look at combinatorial games - 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. Like its predecessor, Games of No Chance, this should be on the shelf of all serious combinatorial games enthusiasts. |
| Additional Information |
| BISAC Categories: - Mathematics | Game Theory - Mathematics | Combinatorics - Mathematics | Discrete Mathematics |
| Dewey: 519.27 |
| LCCN: 2002034798 |
| Series: Mathematical Sciences Research Institute Publications |
| Physical Information: 1.28" H x 6.46" W x 9.52" (1.95 lbs) 548 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |
