+612 9045 4394
 
CHECKOUT
More Games of No Chance : Mathematical Sciences Research Institute Publications - Richard J. Nowakowski

More Games of No Chance

Mathematical Sciences Research Institute Publications

By: Richard J. Nowakowski (Editor)

Paperback

Published: 17th February 2011
RRP $72.95
$64.95
11%
OFF
This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

Other Available Formats (Hide)

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.

"Combinatorial games provide the teacher with a creative means to allow students to explore mathematical ideas and develop problem-solving skills. While the rules are simple, there are rich mathematical theories underlying these games. Students are puzzled at first, and seem to make random moves. By encouraging them to start with simple games with a small number of pieces and then gradually increase the complexity, students are able to formulate and test their own theories for strategic solutions." S. Wali Abdi, School Science and Mathematics

The Big Picture
Idempotents among partisan games
On the lattice Structure of finite games
More infinite games
Alpha-Beta pruning under partial orders
The abstract structure of the group of games
The Old Classics
Higher numbers in pawn endgames on large chessboards
Restoring fairness to Dukego
Go thermography: the 4/21/98 Jiang-Rui endgame
An application of mathematical game theory to go endgames: some width-two-entrance rooms with and without
Go endgames are PSPACE-hard
Global threats in combinatorial games: a computation model with applications to chess endgames
The games of hex: the hierarchical approach
Hypercube tic-tac-toe
Transfinite chomp
A memory efficient retrograde algorithm and its application to Chinese chess endgames
The New Classics: 16: The 4G4G4G4G4 problems and solutions
Experiments in computer amazons
Exhaustive search in amazons
Two-player games on cellular automata
Who wins domineering on rectangular boards?
Forcing your opponent to stay in control of a loony dot-and-boxes endgame
1 x n Konane: a summary of results
1-dimensional peg solitaire, and duotaire
Phutball endgames are hard
One-dimensional phutball
A symmetric strategy in graph avoidance games
A simple FSM-based proof of the additive periodicity of the Sprague-Grundy function of Wythoff's games
Puzzles and Life
The complexity of clickomania
Coin-moving puzzles
Searching for spaceships
Surveys
Unsolved puzzles in combinatorial game theory: updated
Bibliography of combinatorial games: updated
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521155632
ISBN-10: 0521155630
Series: Mathematical Sciences Research Institute Publications
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 548
Published: 17th February 2011
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 23.4 x 15.6  x 2.8
Weight (kg): 0.76
Edition Type: Annotated