Temporal difference learning and TD-Gammon

  title={Temporal difference learning and TD-Gammon},
  author={G. Tesauro},
  journal={Commun. ACM},
  • G. Tesauro
  • Published 1995
  • Computer Science
  • Commun. ACM
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
1,122 Citations
Solving Go on a 3x3 Board Using Temporal-Difierence Learning
TD-GAC: Machine Learning Experiment with Give-Away Checkers
  • 9
  • PDF
Why co-evolution beats temporal difference learning at Backgammon for a linear architecture, but not a non-linear architecture
  • P. Darwen
  • Computer Science
  • Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546)
  • 2001
  • 24
Learning Minesweeper with Multirelational Learning
  • 18
  • PDF
Machine Learning for Prediction and Control
  • 1
  • PDF
Learning a Strategy with Neural Approximated Temporal-Difference Methods in English Draughts
  • 9
  • PDF
Some thoughts on using Computational Intelligence methods in classical mind board games
  • J. Mańdziuk
  • Computer Science
  • 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)
  • 2008
  • 14
Mastering board games
  • 1