arXiv (All)
open access
Beyond Search-Imitation: Prior-Directed Exploration for Searchless Chess
Searchless chess networks reach human master strength from a single forward pass by imitating a stronger teacher: the strongest, Leela Chess Zero's (Lc0) released Chessformer, distills the visit counts of an AlphaZero-style Monte Carlo Tree Search (MCTS). Imitating a search is a poor proxy for playi
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
- Online Robust Reinforcement Learning Through Monte-Carlo Planning#1012776
- Online Robust Reinforcement Learning Through Monte-Carlo Planning#965436
- Synchronous Monte Carlo method and its application to a mean-field spin glass model#1143391
- Non-autonomous iteration in the unit disk#1165411
- AgentDynEx: Nudging the Mechanics and Dynamics of Multi-Agent Simulations#155555
Record · ID 820652
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