Some Theoretical Results Concerning Automated Game-Playing
Proceedings of the Third International Joint Conference on Artificial Intelligence. Theory of Heuristic Search. Pages 18-21.
Abstract
Though evaluation functions have been used in many game-playing and problem-solving programs the aim has generally been to construct sui table functions for particular situations. A formal framework is outlined in which general properties of evaluation functions can be studied. An application of these concepts is made to the study of when dec is ion rules (as exhibited by a players actual play) can be represented by evaluation functions.
T. B. Boffey. 1973. Some Theoretical Results Concerning Automated Game-Playing. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73. IJCAI, 18–21. https://ijcai.org/proceedings/1973/3
Boffey, T. B. (1973). Some Theoretical Results Concerning Automated Game-Playing. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 (pp. 18–21). IJCAI. https://ijcai.org/proceedings/1973/3
@inproceedings{ijcai1973p3,
title = {Some Theoretical Results Concerning Automated Game-Playing},
author = {Boffey, T. B.},
booktitle = {Proceedings of the Third International Joint Conference on
Artificial Intelligence, {IJCAI-73}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Nils J. Nilsson},
pages = {18--21},
year = {1973},
month = {8},
note = {Theory of Heuristic Search},
url = {https://ijcai.org/proceedings/1973/3},
}
TY - CPAPER TI - Some Theoretical Results Concerning Automated Game-Playing AU - Boffey, T. B. T2 - Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73 PB - International Joint Conferences on Artificial Intelligence PY - 1973 SP - 18 EP - 21 UR - https://ijcai.org/proceedings/1973/3 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
