Jump to ContentJump to Main Navigation
Thinking as ComputationA First Course$
Users without a subscription are not able to see the full content.

Hector J. Levesque

Print publication date: 2012

Print ISBN-13: 9780262016995

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262016995.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2017. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use (for details see http://www.mitpress.universitypressscholarship.com/page/privacy-policy).date: 15 December 2017

Case Study: Playing Strategic Games

Case Study: Playing Strategic Games

Chapter:
(p.209) 10 Case Study: Playing Strategic Games
Source:
Thinking as Computation
Author(s):

Levesque Hector J.

Publisher:
The MIT Press
DOI:10.7551/mitpress/9780262016995.003.0010

This chapter focuses on the playing of games with the following characteristics: discrete-move and turn-taking, deterministic, two-person, perfect-information, and zero sum. The first section explores how game problems of this sort are similar to, and different from, the planning problems of Chapter 9, and how the rules of a game can be encoded in Prolog. The second section develops a general game player in Prolog, analogous to the general planning program of Chapter 9. The third section considers how the thinking has to adapt for more complex games like chess.

Keywords:   Prolog programming, game playing, planning problems, game player, thinking

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.