大葉大學圖書館 |

Games, puzzles, and computation[electronic resource] /

纪录类型:	书目-语言数据,印刷品 : Monograph/item
[NT 15000414] null:	510
[NT 47271] Title/Author:	Games, puzzles, and computation/ Robert A. Hearn, Erik D. Demaine.
作者:	Hearn, Robert A.
[NT 51406] other author:	Demaine, Erik D.,
出版者:	Wellesley, Mass. : : A K Peters, Ltd.,, c2009.
面页册数:	1 online resource (ix, 237 p.) : : ill. (chiefly col.)
标题:	Problem solving - Mathematical models.
标题:	Games - Mathematical models.
标题:	Logic, Symbolic and mathematical.
ISBN:	9781439865057 (electronic bk.)
ISBN:	1439865051 (electronic bk.)
[NT 15000227] null:	Includes bibliographical references and index.
[NT 15000228] null:	1. Introduction I. Games in General. 2. The Constraint-Logic Formalism -- 3. Constraint-Logic Games -- 4. Zero-Player Games (Simulations) -- 5. One-Player Games (Puzzles) -- 6. Two-Player Games -- 7. Team Games -- 8. Perspectives on Part I -- II. Games in Particular. 9. One-Player Games (Puzzles) -- 10. Two-Player Games -- 11. Perspectives on Part II -- 12. Conclusions -- Appendices. 1. Survey of Games and Their Complexities -- 2. Computational-Complexity Reference -- 3. Deterministic Constraint Logic Activation Sequences -- 4. Constraint-Logic Quick Reference.
[NT 15000229] null:	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.
电子资源:	http://www.crcnetbase.com/isbn/978-1-56881-322-6

Games, puzzles, and computation[electronic resource] /
Hearn, Robert A.

Games, puzzles, and computation[electronic resource] /Robert A. Hearn, Erik D. Demaine. - Wellesley, Mass. :A K Peters, Ltd.,c2009. - 1 online resource (ix, 237 p.) :ill. (chiefly col.)

Includes bibliographical references and index.

1. Introduction I. Games in General. 2. The Constraint-Logic Formalism -- 3. Constraint-Logic Games -- 4. Zero-Player Games (Simulations) -- 5. One-Player Games (Puzzles) -- 6. Two-Player Games -- 7. Team Games -- 8. Perspectives on Part I -- II. Games in Particular. 9. One-Player Games (Puzzles) -- 10. Two-Player Games -- 11. Perspectives on Part II -- 12. Conclusions -- Appendices. 1. Survey of Games and Their Complexities -- 2. Computational-Complexity Reference -- 3. Deterministic Constraint Logic Activation Sequences -- 4. Constraint-Logic Quick Reference.

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.Subjects--Topical Terms:

558773
Problem solving
--Mathematical models.Index Terms--Genre/Form:

336502
Electronic books.

LC Class. No.: QA63 / .H35 2009

Dewey Class. No.: 510

Games, puzzles, and computation[electronic resource] /
LDR:02084cam a2200277Ia 4500 001 400778
003 OCoLC
005 20140108090648.0
006 m o d
007 cr |||||||||||
008 140127s2009 maua ob 001 0 eng d
020 $z 9781568813226 (alk. paper)
020 $z 1568813228 (alk. paper)
020 $a 9781439865057 (electronic bk.)
020 $a 1439865051 (electronic bk.)
035 $a ocn752209218
040 $a CUS $c CUS $d OCLCQ
050 4 $a QA63 $b .H35 2009
082 0 0 $a 510 $2 22
100 1 $a Hearn, Robert A. $3 558771
245 1 0 $a Games, puzzles, and computation $h [electronic resource] / $c Robert A. Hearn, Erik D. Demaine.
260 $a Wellesley, Mass. : $b A K Peters, Ltd., $c c2009.
300 $a 1 online resource (ix, 237 p.) : $b ill. (chiefly col.)
504 $a Includes bibliographical references and index.
505 2 $a 1. Introduction I. Games in General. 2. The Constraint-Logic Formalism -- 3. Constraint-Logic Games -- 4. Zero-Player Games (Simulations) -- 5. One-Player Games (Puzzles) -- 6. Two-Player Games -- 7. Team Games -- 8. Perspectives on Part I -- II. Games in Particular. 9. One-Player Games (Puzzles) -- 10. Two-Player Games -- 11. Perspectives on Part II -- 12. Conclusions -- Appendices. 1. Survey of Games and Their Complexities -- 2. Computational-Complexity Reference -- 3. Deterministic Constraint Logic Activation Sequences -- 4. Constraint-Logic Quick Reference.
520 $a 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.
588 $a Description based on print version record.
650 0 $a Problem solving $x Mathematical models. $3 558773
650 0 $a Games $x Mathematical models. $3 558774
650 0 $a Logic, Symbolic and mathematical. $3 381130
655 4 $a Electronic books. $2 local $3 336502
700 1 $a Demaine, Erik D., $d 1981- $3 558772
856 4 0 $u http://www.crcnetbase.com/isbn/978-1-56881-322-6