Abstract
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 problem inputs and performance measures are clear-cut and well defined, and the game environment is readily automated in that it is easy to simulate the board, the rules of legal play, and the rules regarding when the game is over and determining the outcome.
Keywords
SophisticationComputer scienceVariety (cybernetics)Artificial intelligenceIdeal (ethics)Domain (mathematical analysis)Outcome (game theory)Machine learningMathematicsMathematical economics
Related Publications
TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results, based on the TD(λ) reinforcement le...
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
One program to rule them all Computers can beat humans at increasingly complex games, including chess and Go. However, these programs are typically constructed for a particular ...
Sigmoid-weighted linear units for neural network function approximation in reinforcement learning
In recent years, neural networks have enjoyed a renaissance as function approximators in reinforcement learning. Two decades after Tesauro's TD-Gammon achieved near top-level hu...
Temporal credit assignment in reinforcement learning
This dissertation describes computational experiments comparing the performance of a range of reinforcement-learning algorithms. The experiments are designed to focus on aspects...
Publication Info
- Year
- 1995
- Type
- article
- Volume
- 38
- Issue
- 3
- Pages
- 58-68
- Citations
- 1457
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1457
OpenAlex
Cite This
(1995).
Temporal difference learning and TD-Gammon.
Communications of the ACM
, 38
(3)
, 58-68.
https://doi.org/10.1145/203330.203343
Identifiers
- DOI
- 10.1145/203330.203343