嶺東科技大學 |

Games, puzzles, and computation

紀錄類型:	書目-電子資源 : 單行本
作者:	HearnRobert A.,
其他作者:	DemaineErik D., 1981-
出版地:	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 -
標題:	Electronic books -
電子資源:	http://www.crcnetbase.com/isbn/978-1-56881-322-6
附註:	Description based on print version record
摘要註:	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
ISBN:	9781439865057electronic bk.
ISBN:	1439865051electronic bk.
內容註:	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

Games, puzzles, and computation
Hearn, Robert A.

Games, puzzles, and computation / Robert A. Hearn, Erik D. Demaine - Wellesley, Mass. : A K Peters, Ltd, c2009. - 1 online resource (ix, 237 p.) ; ill. (chiefly col.).
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.
Description based on print version record.
Includes bibliographical references and index.
ISBN 9781439865057ISBN 1439865051
Problem solvingGamesLogic, Symbolic and mathematicalElectronic books -- Mathematical models -- Mathematical models

Demaine, Erik D.

Games, puzzles, and computation
LDR:01987clm0 2200265 4500 001 290297
009 ocn752209218
010 1 $z 9781568813226
010 1 $z 1568813228
010 1 $a 9781439865057 $b electronic bk.
010 1 $a 1439865051 $b electronic bk.
100 $a 20140307d2009 k y0engy01 b
101 0 $a eng
102 $a us $b ma
105 $a a a 001yy
200 1 $a Games, puzzles, and computation $f Robert A. Hearn, Erik D. Demaine
204 1 $a electronic resource
210 $a Wellesley, Mass. $d c2009 $c A K Peters, Ltd
215 1 $a 1 online resource (ix, 237 p.) $c ill. (chiefly col.)
300 $a Description based on print version record
320 $a Includes bibliographical references and index
327 0 $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
330 $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
606 $a Problem solving $x Mathematical models $2 lc $3 341729
606 $a Games $x Mathematical models $2 lc $3 341730
606 $a Logic, Symbolic and mathematical $2 lc $3 336699
606 $a Electronic books $2 lc $3 321766
676 $a 510 $v 22
680 $a QA63 $b H35 2009
700 1 $a Hearn $b Robert A. $3 341727
702 1 $a Demaine $b Erik D. $f 1981- $3 341728
856 4 0 $u http://www.crcnetbase.com/isbn/978-1-56881-322-6