Engineering Efficient Self-Play Chess: Search, Replay, and Throughput Under Limited Compute
cs.LG, cs.AI
Submitted: 2026-09-27
Updated: 2026-09-27
Sources
- Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
- Accelerating Self-Play Learning in Go
- Learning to Stop: Dynamic Simulation Monte-Carlo Tree Search
- Prioritized Experience Replay
- Targeted Search Control in AlphaZero for Effective Policy Improvement
- Monte-Carlo Graph Search for AlphaZero
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks