Learning of resource allocation strategies for game playing

Computational Intelligence

Volumn 12, Issue 1, 1996, Pages 88-105

  Markovitch, Shaul ^a   Sella, Yaron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Checkers; Class assignment; Dynamic classification; Game playing; Learning; Resource allocation; Time

Indexed keywords

GAME THEORY; LEARNING ALGORITHMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

CLASS ASSIGNMENT; DYNAMIC CLASSIFICATION; GAME PLAYING;

LEARNING SYSTEMS;

EID: 5844259149     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8640.1996.tb00254.x     Document Type: Article

References (19)

1. ANATHARAMAN, T., M. CAMPBELL, and F. H. Hsu. Singular extensions: adding selectivity to brute-force searching. Artificial Intelligence, 43:99-109.
2. BEAL, D. F. 1990. A generalised quiescence search algorithm. Artificial Intelligence, 43:85-98.
3. BODDY, M., and T. DEAN, 1988. An analysis of time-dependent planning. In Proceedings of the Seventh National Conference on Artificial Intelligence. Morgan Kaufmann, St. Paul, MN. pp. 49-54.
4. BODDY, M., and T. DEAN. 1989. Solving time-dependent planning problems. In Proceedings of the Eleventh International Joint Conference for Artificial Intelligence. Detroit, MI, pp. 979-984.
5. CARMEL, D., and S. MARKOVITCH. 1994. The m* algorithm: incorporating opponent models into adversary search. TR 9402, Center for Intelligent Systems, Technion.
6. HORVITZ, E. J. 1987. Reasoning about beliefs and actions undercomputational resource constraints. In Proceedings of the Third Workshop on Uncertainty in Artificial Intelligence. Morgan Kaufmann, Seattle, WA, pp. 301-324.
7. HYATT, R. M. 1984. Using time wisely. ICCA Journal, 1:4-9.
8. KIRA, K., and L. A. RENDELL. 1992. A practical approach to feature selection. In Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, Aberdeen, Scotland.
9. KORF, R. E. 1985. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27:97-109.
10. LEVINSON, R. 1991. Pattern associativity and the retrieval of semantic networks. Computers and Mathematics (Special issue on Semantic Network in Artificial Intelligence).
11. LEVY, D., and M. NEWBORN. 1991. How computers play chess. Computer Science Press, NY.
12. MARKOVITCH, S., and P D. SCOTT. 1993. Information filtering: selection mechanisms in learning systems. Machine Learning, 10:113-151.
13. NAU, D. S. 1980. Pathology on game trees: a summary of results. In Proceedings of the First National Conference on Artificial Intelligence. Pitman, Stanford, CA, pp. 102-104.
14. NAU, D. S. 1982. An investigation of the causes of pathology in games. Artificial Intelligence, 19:257-278.
15. PEARL, J. 1983. On the nature of pathology in game searching. Artificial Intelligence, 20:427-453.
16. QUINLAN, J. R. 1986. Induction of decision trees. Machine Learning, 1:81-106.
17. SAMUEL, A. L. 1959. Some studies in machine learning using the game of checkers. IBM Journal, 3(3):211-229.
18. SCHAFFER, C. 1992. Overfitting avoidance as bias. In Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, Aberdeen, Scotland.
19. SCHEUCHER, A., and H. KAINDEL. 1989. The reason for the benefits of minimax search. In Proceedings of the Eleventh International Joint Conference for Artificial Intelligence, Detroit, MI, pp. 322-327.