Learning of Resource Allocation Strategies for Game Playing
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Machine Learning. Pages 974-978.
Abstract
Human chess players exhibit a large variation in the amount of time they allocate for each move. Yet, the problem of devising resource allocation strategies for game playing did not receive enough attention . In this paper we present a framework for studying resource allocation strategies. We define allocation strategy and identify three major types of strategies: static, semi-dynamic, and dynamic. We then proceed to describe a method for learning semi-dynamic strategies from self generated examples. The method assigns classes to the examples based on the utility of investing extra resources. The method was implemented in the domain of checkers, and experimental results show that it is able to learn strategies that improve game-playing performance.
@inproceedings{ijcai1993p134,
title = {Learning of Resource Allocation Strategies for Game Playing},
author = {Markovitch, Shaul and Sella, Yaron},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {974--978},
year = {1993},
note = {Machine Learning},
url = {https://ijcai.org/proceedings/1993/134},
}
TY - CPAPER TI - Learning of Resource Allocation Strategies for Game Playing AU - Markovitch, Shaul AU - Sella, Yaron T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 974 EP - 978 UR - https://ijcai.org/proceedings/1993/134 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
