Learning and Improving Backgammon Strategy
Not on the map. Why?
Abstract (arXiv)
A novel approach to learning is presented, combining features of on-line and off-line methods to achieve considerable performance in the task of learning a backgammon value function in a process that exploits the processing power of parallel supercomputers. The off-line methods comprise a set of techniques for parallelizing neural network training and TD(λ) reinforcement learning; here Monte-Carlo ``Rollouts'' are introduced as a massively parallel on-line policy improvement technique which applies resources to the decision points encountered during the search of the game tree to further augment the learned value function estimate. A level of play roughly as good as, or possibly better than, the current champion human and computer backgammon players has been achieved in a short period of learning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 5 references that are in the map. First posted on arXiv 3 Apr 2025.
Builds on
0 of 5 references.
No references here yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026PureTD: Reinforcement Learning for Backgammon Money Games with No Evaluation-time Search
- 2018Backplay: "Man muss immer umkehren"
- 2024Enhancing Reinforcement Learning Through Guided Search
- 2024Acceleration for Deep Reinforcement Learning using Parallel and Distributed Computing: A Survey
- 2024Model Predictive Control and Reinforcement Learning: A Unified Framework Based on Dynamic Programming
- 2025Relative Entropy Pathwise Policy Optimization
- 2025Reinforcement Learning from Human Feedback
- 2025Yahtzee: Reinforcement Learning Techniques for Stochastic Combinatorial Games