The authors built an AlphaZero-style chess system optimized for efficient self-play. They trained from random initialization on a single 8-GPU node for 2.5 days, using searched self-play to generate training data. The system consumed over 3 million games and 100 billion search simulations.
The resulting 6.3-million-parameter model reached a benchmark Elo of 3251 with 100,000 searches per move (estimated at under 5 seconds of think time). Without search, it played at 1658 Elo. All measurements were against a fixed Stockfish 13 ladder.
This work is notable for demonstrating the strength achievable under a strict compute budget, and for documenting which engineering choices improved the final system and which did not. The authors share both successful optimizations and plausible alternatives that failed to help the overall training loop.