Skip Navigation

The Computer Journal 1980 23(4):347-352; doi:10.1093/comjnl/23.4.347
© 1980 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bramer, M. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Correct and optimal strategies in game playing programs

M. A. Bramer *

Faculty of Mathematics, The Open University, Milton Keynes, UK

This paper considers the distinction between winning strategies in game playing programs which are either ‘optimal’ or ‘correct’, i.e. which do or do not invariably select shortest path winning moves. The relative merits of these two types of strategy are considered and methods are proposed for producing correct algorithms by a process of iterative refinement based on an analysis of ‘win-trees’. An example is given of a fully correct strategy for the King and Rook against King chess endgame produced in this way.

Received June 1979.

* Faculty of Mathematics, The Open University, Milton Keynes, MK7 6AA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.