Testing Correctness of Strategies in Game-Playing Programs

Bramer, Max A.

Testing Correctness of Strategies in Game-Playing Programs

Download BibTeX Cite

Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .

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 prod~cing 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 endgame.

Max A. Bramer. 1979. Testing Correctness of Strategies in Game-Playing Programs. In Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79. IJCAI, https://ijcai.org/proceedings/1979/25

@inproceedings{ijcai1979p25,
  title     = {Testing Correctness of Strategies in Game-Playing Programs},
  author    = {Bramer, Max A.},
  booktitle = {Proceedings of the Sixth International Joint Conference on
               Artificial Intelligence, {IJCAI-79}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Bruce G. Buchanan},
  year      = {1979},
  month     = {8},
  url       = {https://ijcai.org/proceedings/1979/25},
}

TY  - CPAPER
TI  - Testing Correctness of Strategies in Game-Playing Programs
AU  - Bramer, Max A.
T2  - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1979
UR  - https://ijcai.org/proceedings/1979/25
ER  -