Pith. sign in

REVIEW 1 cited by

Mastering Chess with a Transformer Model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.12272 v2 pith:TMBXCO5V submitted 2024-09-18 cs.LG

classification cs.LG
keywords chessmodelscomputationengineslessmodelpositionrepresentation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Transformer models have demonstrated impressive capabilities when trained at scale, excelling at difficult cognitive tasks requiring complex reasoning and rational decision-making. In this paper, we explore the application of transformers to chess, focusing on the critical role of the position representation within the attention mechanism. We show that transformers endowed with a sufficiently expressive position representation can match existing chess-playing models at a fraction of the computational cost. Our architecture, which we call the Chessformer, significantly outperforms AlphaZero in both playing strength and puzzle solving ability with 8x less computation and matches prior grandmaster-level transformer-based agents in those metrics with 30x less computation. Our models also display an understanding of chess dissimilar and orthogonal to that of top traditional engines, detecting high-level positional features like trapped pieces and fortresses that those engines struggle with. This work demonstrates that domain-specific enhancements can in large part replace the need for model scale, while also highlighting that deep learning can make strides even in areas dominated by search-based methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 3 citations worldwide. Full citation record

  1. TransZero: Parallel Tree Expansion in MuZero using Transformer Networks

    cs.LG 2025-09 conditional novelty 4.0 of 10

    TransZero parallelizes Monte Carlo tree search expansion using a transformer dynamics network and a variance-based evaluator, achieving up to an 11x wall-clock speedup over MuZero without sacrificing final reward.

Pith tools