Engineering Efficient Self-Play Chess: Search, Replay, and Throughput Under Limited Compute

arXiv:2609.37447v1 Announce Type: cross Abstract: How strong can an AlphaZero-style chess system become under limited training compute when its entire learning loop is engineered for efficiency? We train from random initialization through searched…

Read the full story at arXiv cs.AI ↗