Games, puzzles, and computation /

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...

Full description

Bibliographic Details
Main Author: Hearn, Robert A.
Corporate Author: Taylor & Francis
Other Authors: Demaine, Erik D., 1981-
Format: eBook
Language:English
Language Notes:English.
Published: Wellesley, Mass. : A K Peters, Ltd., ©2009.
Subjects:
Online Access:Connect to the full text of this electronic book
Description
Summary: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.
Physical Description:1 online resource (ix, 237 pages) : illustrations (chiefly color)
Bibliography:Includes bibliographical references and index.
ISBN:9781439865057
1439865051
9781568814056
1568814054
0429192746
9780429192746