Chess transformer search: 6-ply depth, 4,096 nodes, 10-second cap with heuristic pruning
andreisavu · x · 2026-11-08
Parts 14-15 of an ongoing thread on building a chess transformer cover the inference-time search design:
- Search caps: frontier search batches are bounded at 6 plies, 4,096 nodes, and a nominal 10 seconds. Clock constraints shrink the budget, so termination and a legal fallback move must fit within available time.
- Candidate pruning: probability concentration selects 2-4 candidates per node, with at least 3 kept on opponent turns. The author admits these thresholds are uncalibrated heuristics — a critical move can remain outside the tree.
More from Research
- The meta-question as agent swarms scale: can models beat gradient descent at its own game? — JensHonack · 2026-11-08
- Why can LLMs solve PhD-level math but still lose at chess? Reddit asks — MesloubFC · 2026-11-08
- WebHarbor launches: 153 mirrored real websites and 3,518 tasks for GUI web agents — HuaxiuYaoML · 2026-11-08
- METR Progress per R&D Dollar Fell 63% Even as Yearly Gains Doubled — sebkrier · 2026-11-08
- GenrobotAI's DAS Dex 2.0 captures 21-DoF hand motion plus 980 tactile points for robot learning — CyberRobooo · 2026-11-08
- fordycelab proposes benchmarking binder-design algorithms with Kd measurements on 24,000-VHH libraries — anshulkundaje · 2026-11-08