arXiv (All)
open access
Engineering Efficient Self-Play Chess: Search, Replay, and Throughput Under Limited Compute
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 self-play on a single eight-GPU node for 2.5 days. The resulting 6.32-million-parameter model reaches
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The infinite volume limit of the Hopfield neural networks in the replica-symmetric regime#1014473
- Robust PAC Learning of Concurrent Stochastic Games#639654
- Rhythm Training of a Serious Game on the Reading Skills of Children w/ a Specific Learning Disorder Impacting Reading#1086659
- The Philosophical Game of Chess: A Framework for Collaborative Intellectual Inquiry and Shared Philosophical Investment#701223
- HyperTransfer: Understanding the Equivalence between Base Optimizer and Hyperball#975086
Record · ID 1141769
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive