Library Working Hours During Recess
Monday to Friday	09:00 AM - 07:00 PM
Saturday	09:00 AM - 05:00 PM
Sundays & Holidays	Closed

Patron Checkouts
Patrons	No. of Books Issued	Loan Period	Overdue Charges
Faculty	25	6 months	Nil
Students	10	2 Weeks	Re. 1 Per Book Per Day
Research Scholars	15	30 Days	Nil
Staff	5	30 Days	Nil

Image from Amazon.com

Normal view MARC view ISBD view

Games, puzzles and computation / Robert A. Hearn and Erik D. Demaine

By:

Hearn, Robert A

Contributor(s):

Demaine, Erik D

Material type: Text

TextPublication details: United Kingdom A. K. Peters 2009Description: 237 pISBN:

9781568813226

Subject(s):

DDC classification:

510 HEA-R

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Shelving location	Call number	Status	Date due	Barcode	Item holds
Books	BITS Pilani Hyderabad	510	General Stack (For lending)	510 HEA-R (Browse shelf(Opens below))	Available		38405

Total holds: 0

Browsing BITS Pilani Hyderabad shelves, Shelving location: General Stack (For lending), Collection: 510 Close shelf browser (Hides shelf browser)

Previous								Next
Previous	510 HAS-B Fascinating fun with numbers /	510 HAS-B Mesmerising magic using maths /	510 HAS-B Mysterious magic squares /	510 HEA-R Games, puzzles and computation /	510 HEW-E Abstract harmonic analysis (Volume 1) : structure of topological groups, integration theory, group representations /	510 HIG-P Nets, puzzles, and postmen /	510 HIL-P Mathematical vistas : from a room with many windows /	Next

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.

There are no comments on this title.

to post a comment.