Learning extension parameters in game-tree search

Information Sciences

Volumn 154, Issue 3-4 SPEC., 2003, Pages 95-118

  Björnsson, Yngvi ^a   Marsland, T A ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS; ONLINE SYSTEMS; TREES (MATHEMATICS);

GAME-TREE SEARCH;

GAME THEORY;

EID: 0038006693     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(03)00045-8     Document Type: Article

References (24)

1. Anantharaman T.S., Campbell M.S., Hsu F. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence. 43(1):1990;99-109.
2. Baxter J., Tridgell A., Weaver L. Learning to play chess using temporal differences. Machine Learning. 40(3):2000;243-263.
3. Beal D.F., Smith M.C. Quantification of search extension benefits. ICCA Journal. 18(4):1995;205-218.
4. Beal D.F., Smith M.C. Learning piece values using temporal differences. ICCA Journal. 20(3):1997;147-151.
5. Y. Björnsson, Selective Depth-First Game-Tree Search, Ph.D. Thesis, Department of Computing Science, University of Alberta, Edmonton, Alberta, April, 2002.
6. Y. Björnsson, T.A. Marsland, Learning search control in adversary games, in: H.J. van den Herik, B. Monien (Eds.), Advances in Computer Games 9, 2001, pp. 157-174, University of Maastricht/University of Paderborn.
7. M. Buro, Experiments with multi-probcut and a new high-quality evaluation function for Othello, in: H.J. van den Herik, H. Lida (Eds.), Games in AI Research, 2000, pp. 77-96, Universiteit Maastricht, Maastricht, The Netherlands.
8. M. Buro, Towards opening book learning, in: H.J. van den Herik, H. Lida (Eds.), Games in AI Research, 2000, pp. 47-54, Universiteit Maastricht, Maastricht, The Netherlands.
9. T. Cazenave, Generation of patterns with external conditions for the game of Go, in: H.J. van den Herik, B. Monien (Eds.), Advances in Computer Games 9, 2001, pp. 275-293, University of Maastricht/University of Paderborn.
10. Fürnkranz J. Machine learning in games: A survey. Fürnkranz J., Kubat M. Machines That Learn to Play Games. 2001;11-59 Nova Science Publishers, Inc. Huntington, New York.
11. Greer K. Computer chess move-ordering schemes using move influence. Artificial Intelligence. 120:2000;235-250.
12. R.M. Hyatt, Crafty - chess program, FTP Site, 1996. Available from 〈ftp.cis.uab.edu/pub/hyatt〉.
13. Hyatt R.M. Book learning a methodology to tune an opening book automatically. ICCA Journal. 22(1):1999;3-12.
14. Knuth D.E., Moore R.W. An analysis of alpha-beta pruning. Artificial Intelligence. 6(4):1975;293-326.
15. Kolodner J. Case-Based Reasoning. 1993;Morgan Kaufmann Publishers, San Mateo, CA.
16. V. Koscis, J. Uiterwijk, Learning move ordering in chess, in: Proceedings of the CMG Sixth Computer Olympiad Computer Games Workshop, July 2001.
17. Krogius N., Livsic A., Parma B., Taimanov M. Encyclopedia of Chess Middlegames. 1980;Chess Informant, Belgrade.
18. Minton S. Learning Search Control Knowledge: An Explanation-based Approach. 1988;Kluwer Academic Publishers, Boston, MA.
19. Mitchell T.M. Machine Learning. 1997;WCB McGraw-Hill. pp. 92-94.
20. Mitchell T.M., Keller R., Kedar-Cabelli S. Explanation-based generalization: A unifying view. Machine Learning. 1(1):1986;47-80.
21. D.E. Moriarty, R. Miikkulainen, Evolving neural networks to focus minimax search, in: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Seattle, WA, 1994.
22. J. Schaeffer, M. Hlynka, V. Jussila, Temporal difference learning applied to a high-performance game-playing program, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-01), Seattle, Washington, August, 2001, pp. 529-534.
23. Tesauro G.J. TD-gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation. 6:1994;215-219.
24. Ye C., Marsland T.A. Experiments in forward pruning with limited extensions. ICCA Journal. 15(2):1992;55-66.