Temporal difference learning and TD-Gammon
@article{Tesauro1995TemporalDL,
title={Temporal difference learning and TD-Gammon},
author={G. Tesauro},
journal={Commun. ACM},
year={1995},
volume={38},
pages={58-68}
}Ever since the days of Shannon's proposal for a chess-playing algorithm [12] and Samuel's checkers-learning program [10] the domain of complex board games such as Go, chess, checkers, Othello, and backgammon has been widely regarded as an ideal testing ground for exploring a variety of concepts and approaches in artificial intelligence and machine learning. Such board games offer the challenge of tremendous complexity and sophistication required to play at expert level. At the same time, the… Expand
Topics from this paper
1,122 Citations
Why co-evolution beats temporal difference learning at Backgammon for a linear architecture, but not a non-linear architecture
- Computer Science
- Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546)
- 2001
- 24
Temporal Difference Learning Applied to a High-Performance Game-Playing Program
- Computer Science
- IJCAI
- 2001
- 91
Learning a Strategy with Neural Approximated Temporal-Difference Methods in English Draughts
- Computer Science
- 2010 20th International Conference on Pattern Recognition
- 2010
- 9
- PDF
Some thoughts on using Computational Intelligence methods in classical mind board games
- Computer Science
- 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)
- 2008
- 14