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.
General
Imprint: |
Cambridge UniversityPress
|
Country of origin: |
United Kingdom |
Series: |
Mathematical Sciences Research Institute Publications |
Release date: |
February 2011 |
First published: |
December 2010 |
Editors: |
Richard Nowakowski
|
Dimensions: |
234 x 156 x 28mm (L x W x T) |
Format: |
Paperback - Trade
|
Pages: |
548 |
ISBN-13: |
978-0-521-15563-2 |
Categories: |
Books >
Science & Mathematics >
Mathematics >
Combinatorics & graph theory
|
LSN: |
0-521-15563-0 |
Barcode: |
9780521155632 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!