Games, Puzzles, and Computation
By: Robert A. Hearn and Erik D. Demaine
Available for a limited time only!
The authors show that there are underlying mathematical reasons for why games and puzzles are challenging (and perhaps why they are so much fun). 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. The appendices provide a substantial survey of all known results in the field of game complexity, serving as a reference guide for readers interested in the computational complexity of particular games, or interested in open problems about such complexities.
MoMath was proud to present Erik Demaine as the speaker for our March, 2011 Math Encounters event. Math Encounters is a new public presentation series celebrating the spectacular world of mathematics and presented by the Simons Foundation and the Museum of Mathematics. To learn more about Math Encounters, please visit mathencounters.org.
- Taylor & Francis (CRC Press)
- Publication Date:
- June 30, 2009
- ISBN 10: