Games, Puzzles, and Computation

by Robert A. Hearn, Erik D. Demaine

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.

Genres: Mathematics, Games

248 pages, Hardcover

First published June 30, 2009

Reviews

[Ami Iida · Rating 4 out of 5]

You can know and enjoy the principle of many kinds of your unknown games, then you can enjoy
them.
When you know unknown games, please enjoy them.
Then they're expressed by graph theory -almost.

[Ravi]

"i take all of your recommendations seriously. i want to know why you like stuff.” - gregory eddie