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.
págs. 1-23
págs. 25-30
págs. 31-36
págs. 37-48
págs. 49-57
págs. 61-78
págs. 79-87
Go Thermography: the 4/21/98 Jiang--Rui Endgame
págs. 89-105
An Application of Mathematical Game Theory to Go Endgames: some Width-Two-Entrance Rooms With and Without Kos
págs. 107-124
págs. 125-136
Global Threats in Combinatorial Games: a Computation Model with Applications to Chess Endgames
págs. 137-149
The Game of Hex: the Hierarchical Approach
págs. 151-165
págs. 167-182
págs. 183-212
págs. 213-227
págs. 231-241
págs. 243-257
págs. 261-278
págs. 279-306
págs. 307-315
págs. 317-330
1 x n Konane: a Summary of Results
págs. 331-339
págs. 341-350
págs. 351-360
págs. 361-367
págs. 369-381
págs. 383-386
págs. 389-404
págs. 405-431
págs. 433-453
págs. 457-473
págs. 475-535
© 2001-2024 Fundación Dialnet · Todos los derechos reservados