Overview

Full Product Details

9781568813226

Table of Contents

Reviews

The authors show that there are underlying mathematical reasons that games and puzzles are challenging (which perhaps explains why they are so much fun). Complementarily, they also show that games and puzzles can serve as powerful models of computation - quite different from the usual models of automata and circuits - offering a new way of thinking about computation. -L'Enseignement Mathematique, December 2009 Although a bit more cumbersome, the title Games, Puzzles, and Computational Complexity would describe this quite intriguing book more precisely. ... Hearn and Demaine present an elegant family of benchmarks they have developed, allowing them to settle open questions on the complexity of various games. ... and the authors certainly provide plenty to mull over. The publisher A K Peters has done a quite nice job of production, as well. All in all, this is a book well worth looking into. -Leon Harkleroad, MAA Reviews, December 2009 This book will be of interest to advanced readers working in this area. -Brian Borchers, CHOICE Magazine, February 2010

The authors show that there are underlying mathematical reasons that games and puzzles are challenging (which perhaps explains why they are so much fun). Complementarily, they also show that games and puzzles can serve as powerful models of computation -- quite different from the usual models of automata and circuits -- offering a new way of thinking about computation. --L'Enseignement Mathematique, December 2009 ! the title Games, Puzzles, and Computational Complexity would describe this quite intriguing book more precisely. ! Hearn and Demaine present an elegant family of benchmarks they have developed, allowing them to settle open questions on the complexity of various games. ! and the authors certainly provide plenty to mull over. The publisher A K Peters has done a quite nice job of production, as well. All in all, this is a book well worth looking into. --Leon Harkleroad, MAA Reviews, December 2009 This book will be of interest to advanced readers working in this area. --Brian Borchers, CHOICE, February 2010

Games, Puzzles, and Computation will serve well in roles similar to that of Garey and Johnson's book. In particular, the text would work exceedingly well as a reference for what's known in the subfield of game/puzzle complexity or for self-study by someone familiar with basic computational complexity principles who is interested in learning more about the complexity of games and puzzles. It would also serve well as supplementary material to an upper-level undergraduate or entry-level graduate special topics course in game/puzzle complexity. It could also be used as the primary text for such a course (in principle) given extra preparation by the instructor ... . -Daniel Apon, SIGACT News, September 2011 The authors show that there are underlying mathematical reasons that games and puzzles are challenging (which perhaps explains why they are so much fun). Complementarily, they also show that games and puzzles can serve as powerful models of computation - quite different from the usual models of automata and circuits - offering a new way of thinking about computation. -L'Enseignement Mathematique, December 2009 ... intriguing book ... Hearn and Demaine present an elegant family of benchmarks they have developed, allowing them to settle open questions on the complexity of various games. ... and the authors certainly provide plenty to mull over. The publisher A K Peters has done a quite nice job of production, as well. All in all, this is a book well worth looking into. -Leon Harkleroad, MAA Reviews, December 2009 This book will be of interest to advanced readers working in this area. -Brian Borchers, CHOICE, February 2010

Author Information

Robert A. Hearn, Dartmouth College, Hanover, New Hampshire, USA Erik Demaine, Massachusetts Institute of Technology, Cambridge, USA

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available