arXiv Machine Learning
Beyond Search-Imitation: Prior-Directed Exploration for Searchless Chess
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Oct 15
SearchMaster: Grounded and Regulated Self-Play for Search Agents
arXiv:2608.01822v2 Announce Type: replace Abstract: Training LLM-based search agents requires high-quality search data: tasks that demand genuine multi-hop retrieval and trajectories that use search...
arXiv AI
Aug 5
When Search Teaches Style: Causal Internalization of Tactical Priors in AlphaZero
arXiv:2504. 14636v3 Announce Type: replace-cross Abstract: AlphaZero is normally evaluated as one agent: a policy-value network fused with Monte Carlo tree search.
arXiv AI
Sep 10
Unsound Search with Policy and Value Networks in Legends of Code and Magic
arXiv:2609.06816v1 Announce Type: new Abstract: Decision-time search in perfect and imperfect information games with enumerable belief states are effective methods for game AI. Collectible card games...
arXiv AI
Sep 30
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 t...
arXiv AI
Jul 9
A Gold-Standard Study of What Makes a Lightweight Game-Playing Agent Strong
arXiv:2607. 06854v1 Announce Type: cross Abstract: Reinforcement learning agents for imperfect-information card games are only as strong as the opponents they train against, and they are hard to grade, since they beat a random opponent over 99 percent of the time and only tie copies of themselves.
arXiv AI
Jun 11
The Algorithm Is Not the Behavior: Learned Priors Override Look-Ahead in a Chess-Playing Neural Network
arXiv:2508. 21380v3 Announce Type: replace-cross Abstract: Recent mechanistic work has uncovered learned algorithms within neural networks, from modular arithmetic to search and planning in game-playing agents.