ChessMimic: Per-Rating Transformer Models for Human Move, Clock, and Outcome Prediction in Online Blitz Chess

• URL: http://arxiv.org/abs/2606.04473v1
• Date: Wed, 03 Jun 2026 05:42:39 GMT
• Title: ChessMimic: Per-Rating Transformer Models for Human Move, Clock, and Outcome Prediction in Online Blitz Chess
• Abstract summary: ChessMimic is a system of three encoder-only transformers for move, thinking-time, and outcome prediction.<n>On a held-out month-wide slice of Lichess Rated Blitz games ChessMimic's human move prediction accuracy outperforms Maia-2 in every Elo band.<n>A public demo is at 1e4.ai and we release code, per-band weights, and the C++ data-filter pipeline code in GitHub.
• Score: 0.08460698440162888
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We present ChessMimic, a system of three small encoder-only transformers - for move, thinking-time, and outcome prediction - conditioned on the position, recent move history, player rating, and clock state. We fit a separate instance of each model per 100-Elo rating band, trading parameter efficiency for sharper per-skill calibration. On a held-out month-wide slice of Lichess Rated Blitz games ChessMimic's human move prediction accuracy outperforms Maia-2 in every Elo band. Compared to Maia-3, our 9M parameter model's accuracy sits between Maia-3-5M and Maia-3-23M without the additional complexity of Geometric Attention Bias. In addition to the move matching model, we also train a game outcome model that conditions not only on the position, but also player ratings, time control, and remaining clock times. The outcome model achieves an AUC of 0.78 out of sample, beating Maia-2 as well as logistic regressions based on material, ratings, and clock time. Finally, we train a clock model that predicts human thinking times. The clock model provides a usable but non-SOTA per-ply think-time signal under ALLIE-style filters (Pearson r = 0.41, Spearman rho = 0.50, MAE 4.10 s, against ALLIE's reported r = 0.70), with the residual gap concentrated in per-position bucket sharpness rather than bucket-marginal calibration. A public demo is at 1e4.ai and we release code, per-band weights, and the C++ data-filter pipeline code in GitHub.

Related papers

• A Calibration Audit of Confidence in Feed-Forward 3D Reconstruction [45.496856835431885]
  3D reconstruction models emit per-pixel confidence that downstream systems read as a reliability signal.<n>We score the confidence on four properties, how well it ranks error, whether its level is right on average, whether it holds across the confidence range, and whether its intervals cover the truth.<n>The confidence ranks error well, but the predicted uncertainty is too low when it is read under conditions that are not exactly those of training.
  arXiv  Detail & Related papers  (2026-08-30T10:21:34Z)
• Otter: A Time-Aware, History-Conditioned Human Chess AI [0.0]
  Otter predicts human move selection by modeling play as a time-aware, sequential process.<n>Otter is trained on 6.1 billion positions from 117 million Lichess rapid games over 30 days on a single T4 GPU.
  arXiv  Detail & Related papers  (2026-08-05T07:47:30Z)
• Elo-Disentangled Player-Style Embeddings for Human Chess via Rating-Conditioned Residual Move Model [0.0]
  We study representation learning for individual human chess style.<n>A per-player embedding is learned from a player's move history.<n>We argue that a strong rating-conditioned base plus a compact, Elo-disentangled embedding is an economical, interpretable model of individual style.
  arXiv  Detail & Related papers  (2026-06-23T21:06:24Z)
• Beyond the Current Observation: Evaluating Multimodal Large Language Models in Controllable Non-Markov Games [69.57330692969543]
  We introduce RNG-Bench, a benchmark suite designed to isolate a base model's ability to reconstruct past observations.<n>RNG-Bench includes two complementary games: Matching Pairs, where card identities briefly revealed at specific locations must later be recalled, and 3D Maze, where egocentric views must be integrated into a spatial map.<n>The hardest configurations require contexts of roughly 128K tokens and 350 image inputs per episode, and remain far from saturated by frontier MLLMs.
  arXiv  Detail & Related papers  (2026-06-17T17:59:34Z)
• DTVEM-RE: A Hierarchical Random-Effects Extension of the Differential Time-Varying Effect Model for Person-Specific Multi-Lag Estimation in Intensive Longitudinal Data [0.0]
  We present DTVEM-RE, an extension that lets each person have their own lag coefficients.<n>It is the first person-specific implementation of DTVEM-style lag detection.
  arXiv  Detail & Related papers  (2026-06-12T04:54:21Z)
• Chess-World-Model: A 10M-Game Benchmark for Exact State Tracking from Chess Move Sequences [2.7214777196418645]
  We introduce Chess-World-Model, a large-scale state-tracking benchmark built from 10 million real chess games.<n>We benchmark a causal Transformer, block-diagonal SLiCE, Mamba-3, and Gated DeltaNet with negative eigenvalues.<n>Real-game performance saturates above 18 million parameters, but the random-uniform split remains discriminative up to 40 million, exposing failures otherwise hidden by scale.
  arXiv  Detail & Related papers  (2026-05-28T15:43:31Z)
• MolmoAct2: Action Reasoning Models for Real-world Deployment [67.6315757474802]
  MolmoAct2 is a fully open action reasoning model built for practical deployment.<n>We introduce MolmoER, a VLM backbone specialized for spatial and embodied reasoning.<n>We release three new datasets spanning low-to-medium cost platforms.
  arXiv  Detail & Related papers  (2026-05-04T17:51:21Z)
• Tracking vs. Deciding: The Dual-Capability Bottleneck in Searchless Chess Transformers [3.692740024498697]
  A human-like chess engine should mimic the style, errors, and consistency of a strong human player rather than maximize playing strength.<n>We show that training from move sequences alone forces a model to learn two capabilities: state tracking, which reconstructs the board from move history, and decision quality, which selects good moves from that reconstructed state.<n>We formalize this tension as a dual-capability bottleneck, P = min(T,Q), where overall performance is limited by the weaker capability.
  arXiv  Detail & Related papers  (2026-03-31T14:01:39Z)
• Moirai 2.0: When Less Is More for Time Series Forecasting [91.36760228926214]
  Moirai 2.0 is a decoder-only foundation model trained on a new corpus of 36M series.<n>It ranks among the top pretrained models while achieving a strong trade-off between accuracy, speed, and model size.<n>In terms of efficiency and model size, Moirai 2.0 is twice as fast and thirty times smaller than its prior best version, Moirai 1.0-Large.
  arXiv  Detail & Related papers  (2025-11-12T12:15:35Z)
• Chess Rating Estimation from Moves and Clock Times Using a CNN-LSTM [11.340099493701029]
  We propose a method to estimate player ratings directly from game moves and clock times. Our model architecture comprises a CNN to learn positional features, which are integrated with clock-time data into a Bidirectional LSTM. This model is the first to use no hand-crafted features to estimate chess ratings and also the first to output a rating prediction after each move.
  arXiv  Detail & Related papers  (2024-09-17T19:19:16Z)
• Efficient Offline Policy Optimization with a Learned Model [83.64779942889916]
  MuZero Unplugged presents a promising approach for offline policy learning from logged data. It conducts Monte-Carlo Tree Search (MCTS) with a learned model and leverages Reanalyze algorithm to learn purely from offline data. This paper investigates a few hypotheses where MuZero Unplugged may not work well under the offline settings.
  arXiv  Detail & Related papers  (2022-10-12T07:41:04Z)
• Probing Model Signal-Awareness via Prediction-Preserving Input Minimization [67.62847721118142]
  We evaluate models' ability to capture the correct vulnerability signals to produce their predictions. We measure the signal awareness of models using a new metric we propose- Signal-aware Recall (SAR) The results show a sharp drop in the model's Recall from the high 90s to sub-60s with the new metric.
  arXiv  Detail & Related papers  (2020-11-25T20:05:23Z)
• Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium [116.56359444619441]
  We develop provably efficient reinforcement learning algorithms for two-player zero-sum finite-horizon Markov games. In the offline setting, we control both players and aim to find the Nash Equilibrium by minimizing the duality gap. In the online setting, we control a single player playing against an arbitrary opponent and aim to minimize the regret.
  arXiv  Detail & Related papers  (2020-02-17T17:04:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.