Testing Correctness of Strategies in Game-Playing Programs
Abstract
This paper considers the distinction between winning strategies in game-playing programs which are either 'optimal' or 'correct'. 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 the development of a fully correct strategy for the King and Rook against King chess end game.
Cite
Text
Bramer. "Testing Correctness of Strategies in Game-Playing Programs." International Joint Conference on Artificial Intelligence, 1979.Markdown
[Bramer. "Testing Correctness of Strategies in Game-Playing Programs." International Joint Conference on Artificial Intelligence, 1979.](https://mlanthology.org/ijcai/1979/bramer1979ijcai-testing/)BibTeX
@inproceedings{bramer1979ijcai-testing,
title = {{Testing Correctness of Strategies in Game-Playing Programs}},
author = {Bramer, Max A.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1979},
pages = {92-94},
url = {https://mlanthology.org/ijcai/1979/bramer1979ijcai-testing/}
}