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.
Author(s): Richard Nowakowski
Series: Mathematical Sciences Research Institute Publications
Publisher: Cambridge University Press
Year: 2002
Language: English
Pages: 547
fm......Page 1
contents......Page 7
pref......Page 10
beidem......Page 12
cali......Page 35
conway......Page 42
ginsberg......Page 48
moews......Page 60
elkies......Page 69
martin......Page 90
spight......Page 99
takizawa......Page 117
wolfe......Page 136
maeser......Page 148
anshel......Page 161
golomb......Page 177
huddleston......Page 194
wu......Page 224
be4g4g......Page 239
muller......Page 253
snatzke......Page 272
fraenkel......Page 290
lachmann......Page 318
beforcing......Page 328
chan......Page 343
moore......Page 352
dephut......Page 363
grossman......Page 373
harary......Page 380
landman......Page 394
biedl......Page 399
decoins......Page 417
eppstein......Page 444
guy......Page 466
frbib......Page 486
