Chess neighborhoods, function combination, and reinforcement learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2063, Issue , 2001, Pages 133-150

  Levinson, Robert ^a   Weber, Ryan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computer chess; Exponentiated gradient; Gradient descent; Linear regression; Multi layer neural nets; Reinforcement learning; Temporal difference learning; Value function approximation

Indexed keywords

COMPUTER GAMES; GRAPHIC METHODS; LEARNING SYSTEMS; LINEAR REGRESSION;

COMPUTER CHESS; GRADIENT DESCENT; GRAPH REPRESENTATION; GRAPH-BASED MODELING; LEARNING EXPERIENCES; PRIOR KNOWLEDGE; TEMPORAL DIFFERENCE LEARNING; VALUE FUNCTION APPROXIMATION;

REINFORCEMENT LEARNING;

EID: 84898646291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45579-5_9     Document Type: Conference Paper

References (29)

1. Allen, J., Hamilton, E., and Levinson, R. New Advances in Adaptive Pattern-Oriented Chess (1997). In H.J. van den Herik and J. W.H., Uiterwijk. Advances in Computer Chess 8, pp. 312-233., Universiteit Maastricht, The Netherlands.
2. th International Conference on Machine Learning (ICML-98), pages 28-36. Madision, WI. 1998. Morgan Kaufmann.
3. Ballard, D. H. An Introduction to Natural Computation. Cambridge: MIT Press.
4. Beal, D. F., & Smith, M.C. (1994). Random Evaluation in Chess. ICCA Journal, Vol. 17, No. 1, pp. 3-9 (A).
5. Beal, D. F., & Smith, M.C. Learning Piece Values Using Temporal Differences. Journal of The International Computer Chess Association, September 1997.
6. Beal, D. F., & Smith, M.C. First results from using temporal difference learning in Shogi. In H. J. van den Herik and H. Iida, editors, Proceedings of the First International Conference on Computers and Games (CG-98), volume 1558 of Lecture Notes in Computer Science, page 114, Tsukuba, Japan, 1998. Springer-Verlag.
7. Bishop, Christopher M. Neural Networks for Pattern Recognition, Oxford Univ. Press, 1998. ISBN 0-19-853864-2.
8. Bradtke, S. J., and Barto, A. G. (1996). Linear least-squares algorithms for temporal difference learning. Machine Learning, 22, 33-57.
9. Christensen, J. and Korf, R. (1986). A unified theory of heuristic evaluation functions and its applications to learning. Proceedings of AAAI-86 (pp. 148-152).
10. Fürnkranz, J., Machine learning in computer chess: The next generation. International Computer Chess Association Journal, 19(3): 147-160, September (1996).
11. Gherrity, M. A Game-Learning Machine. Ph.D thesis. University of California, San Diego. San Diego, CA. 1993.
12. Helmbold, D. P., Kivinen, J., and Warmuth, M. K. (1996a), Worst-case loss bounds for sigmoided linear neurons, in "Advances in Neural Information Processing Systems 8," MIT Press, Cambridge, MA.
13. Herik, H.J. van den. A New Research Scope. International Computer Chess Association Journal 21(4), 1998.
14. Kivinen, J. and Warmuth, M. K. Additive versus exponentiated gradient updates for linear prediction. Information and Computation. Vol. 2, pp. 285-318, 1998.
15. th International Workshop on Machine Learning, pp. 85-89, Morgan Kaufmann.
16. Levinson, R. A., and Snyder, R., "Distance: Towards the Unification of Chess Knowledge", International Computer Chess Association Journal 16(3): 123-136, September 1993.
17. th Annual Conference on Aerospace/Defense Sensing and Controls: Sensor Fusion: Architectures, Algorithms, and Applications IV.
18. Littlestone, N., Long, P.M., and Warmuth, M. K. (1995), On-line learning of linear functions, Journal of Computational Complexity 5, 1-23.
19. Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, Massachusetts.
20. Pellen, Luke. Neural net chess program Octavius: http://home.seol.net.au/luke/Octavius (1999).
21. Samuel, A. (1959). Some studies in machine learning using the game of checkers. IBM J. of Research and Development, 3, 210-229.
22. Scott, J. Machine Learning in Games: the Morph Project, Swarthmore College, Swarthmore, PA. http://forum.swarthmore.edu/~jay/learn-game/projects/morph.html.
23. Slate, D.J., A chess program that uses its transposition table to learn from experience. International Computer Chess Association Journal 10(2): 59-71, 1987.
24. Sutton, R. S. (1988). Learning to predict by the methods of temporal differences. Machine Learning, 3, 9-44.
25. Sutton, R. S., & Barto, A.G. (1998). Reinforcement Learning: An Introduction. Cambridge: MIT Press.
26. Tesauro, G. Temporal Difference Learning and TD-Gammon. Communications of the ACM, Vol 38, No 3, March 1995.
27. Tesauro, G. Practical Issues in Temporal Difference Learning. Machine Learning, 8: 257-278, 1992.
28. Thrun, S., 1995. Learning to Play the Game of Chess. In Advances in Neural Information Processing Systems (NIPS) 7, G. Tesauro, D. Touretzky, and T. Leen (eds.), MIT Press.
29. Widrow, B., and Stearns, S. (1985), "Adaptive Signal Processing," Prentice Hall, Engel-wood Cliffs, NJ.