返回资讯中心
外部精选
软件工程
#开发者实时流

Training a Chess Reasoning Agent

TLDR: I trained an LLM reasoning agent to play chess, with model sizes 0.8B, 2B and 9B. The agent calls tools which help it keep track of the board state, which enables good performance with a relatively small number of…

Hacker News 最新alexmolas2026/10/19 · 28 天前5 分钟阅读

以下正文同步自 Hacker News 最新,版权归原站所有,已转换为易读排版。

TLDR: I trained an LLM reasoning agent to play chess, with model sizes 0.8B, 2B and 9B. The agent calls tools which help it keep track of the board state, which enables good performance with a relatively small number of parameters.

I became excited about the power of RLVR after the Deepseek R1 paper came out. They demonstrated that through the use of “thinking” tokens, an LLM could solve verifiable tasks like math problems. Additionally, they described the necessity of bootstrapping the thinking process with supervised examples, which prevents the model from generating a nonsense chain of thought.

Chess is an ideal candidate for a verifiable rewards setup. You could call it “fractally verifiable”: Not only are games themselves verifiable outcomes, but the strength of individual moves are verifiable, and even the individual claims used to justify those moves can be verified.

The majority of prior work in chess engines has had the sole purpose of maximizing playing strength. I’ve written a longer history of chess engines here and here. This would be a much different type of engine: we should favor explainable, intuitive moves over the absolute best moves.

The short answer is, I initially wanted to train a pure LLM, but a 4090 limits candidate base models to around 3 billion parameters. Unfortunately, the smaller models were plagued by confabulation. Reacting to phantom threats, making illegal moves, and just a general lack of grounding in reality. Allowing the model to call tools that track the board state independently removes this type of error.

The goal of these tools is to allow the harness to track the board state while the LLM reasons about how to search. They are intended to be simple and atomic operations that a human chess player can easily follow along with. None of these tools are intended to provide the LLM with judgement calls about the position.

When calling a tool, the LLM must also provide a justification for why it wants to call this tool. This prevents the reasoning trace from devolving into a list of bare tool calls.

正文由 探How 从来源站点 RSS 同步,内容未经改写;遇到排版缺失或需要图片、视频时请以原文为准。

打开原文
去社区讨论 →