LittlePly's engine assistance capped at 6 plies, 4096 nodes, nominal 10 seconds
andreisavu · x · 2026-11-08
andreisavu's LittlePly chess agent thread reveals the bounded engine assistance design: Stockfish searches frontier positions with caps of 6 plies, 4,096 nodes and a nominal 10 seconds, reduced further by clock constraints. Termination and a legal fallback keep decisions within the available time. Bounded searches assist mating continuations and threats, with selective conversion assistance in very favorable simplified positions — so game results reflect the combined agent.
More from Research
- Reviewers reward flaw-free work, users reward useful work — why peer review punishes innovation — wzenus · 2026-11-08
- Math community debates Glazer's proof and OpenAI's H10 paper: slop need not compound — littmath · 2026-11-08
- Stanford paper: more info helps some LLM trading agents, wrecks others — rohanpaul_ai · 2026-11-08
- Neel Nanda pushes back on LRH critique: one steering vector, four norms, four behaviors — NeelNanda5 · 2026-11-08
- AI-generated Community Note fact-checks weight-space programming paper, author clicks No — DimitrisPapail · 2026-11-08
- Anders Sandberg and Danielle Fong debate why simple progress models eventually break down — anderssandberg · 2026-11-08