More games of no chance

By:

Nowakowski, Richard J. (Ed.)

Series: Mathematical Sciences Research Institute Publications ; 42Publication details: Cambridge: Cambridge University Press, 2002.Description: xii, 535 p.: ill.; pbk.: 24 cmISBN:

9780521155632

Subject(s):

DDC classification:

519.3 NOW

Summary: This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known 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 theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other 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 a bibliography by A. Fraenkel and a 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. Presents results on hot games such as chess, Go, Hex, Amazons, and Chomp Articles from top names in computer science and mathematics, such as Berlekamp, Conway, and Guy Contains an annotated list of unsolved problems and a comprehensive bibliography https://www.cambridge.org/us/universitypress/subjects/mathematics/discrete-mathematics-information-theory-and-coding/more-games-no-chance?format=PB&isbn=9780521155632

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Barcode
Books	IIT Gandhinagar	General	519.3 NOW (Browse shelf(Opens below))	1	Available	035690

Browsing IIT Gandhinagar shelves,Collection: General Close shelf browser (Hides shelf browser)

Previous								Next
Previous	519.3 FAT Infinite dimensional optimization and control theory, Vol. 62	519.3 HAY Hex, inside and out: the full story	519.3 NOW Games of no chance 4	519.3 NOW More games of no chance	519.3 PAR Stochastic games and related concepts	519.3 ROU Algorithms illuminated	519.3 STR Game theory and strategy	Next

Includes Bibliographical References

This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known 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 theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other 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 a bibliography by A. Fraenkel and a 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.

Presents results on hot games such as chess, Go, Hex, Amazons, and Chomp
Articles from top names in computer science and mathematics, such as Berlekamp, Conway, and Guy
Contains an annotated list of unsolved problems and a comprehensive bibliography

https://www.cambridge.org/us/universitypress/subjects/mathematics/discrete-mathematics-information-theory-and-coding/more-games-no-chance?format=PB&isbn=9780521155632

There are no comments on this title.

to post a comment.