Bootstrapping from game tree search

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 1937-1945

  Veness, Joel ^a   Silver, David ^b   Uther, William ^a   Blair, Alan ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; SOFTWARE TESTING; TREES (MATHEMATICS);

ALPHA-BETA SEARCHES; APPROACHES TO LEARNING; CHESS PROGRAM; GAME TREE SEARCH; HEURISTIC EVALUATION FUNCTIONS; HEURISTIC FUNCTIONS; SEARCH TREES; SELF-PLAY; TRAINING SIGNAL;

FUNCTION EVALUATION;

EID: 84858720579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Baxter, J., Tridgell, A., & Weaver, L. (1998). Knightcap: a chess program that learns by combining td(lambda) with game-tree search. Proc. 15th International Conf. on Machine Learning (pp. 28-36). Morgan Kaufmann, San Francisco, CA.
2. Beal, D. F. (1990). A generalised quiescence search algorithm. Artificial Intelligence, 43, 85-98.
3. Beal, D. F., & Smith, M. C. (1997). Learning piece values using temporal differences. Journal of the International Computer Chess Association.
4. Buro, M. (1999). From simple features to sophisticated evaluation functions. First International Conference on Computers and Games (pp. 126-145).
5. Campbell, M., Hoane, A., & Hsu, F. (2002). Deep Blue. Artificial Intelligence, 134, 57-83.
6. Gelly, S., & Silver, D. (2007). Combining online and offline learning in UCT. 17th International Conference on Machine Learning (pp. 273-280).
7. Hauk, T., Buro, M., & Schaeffer, J. (2004). Rediscovering *-minimax search. Computers and Games (pp. 35-50).
8. Samuel, A. L. (1959). Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3.
9. Schaeffer, J. (1989). The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-11, 1203-1212.
10. Schaeffer, J., Hlynka, M., & Jussila, V. (2001). Temporal difference learning applied to a high performance game playing program. IJCAI, 529-534.
11. Sutton, R. (1988). Learning to predict by the method of temporal differences. Machine Learning, 3, 9-44.
12. Tesauro, G. (1994). TD-gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation, 6, 215-219.
13. Veness, J., & Blair, A. (2007). Effective use of transposition tables in stochastic game tree search. IEEE Symposium on Computational Intelligence and Games (pp. 112-116).