Skip to content
AI News HubLIVE
Original source3 min read

Zugwise: Domain-Aware Game Reconstruction for Digitizing Handwritten Chess Scoresheets

Summary

Zugwise reframes handwritten chess scoresheet digitization as game reconstruction, using chess engine machinery to detect silent legal-but-wrong errors and merging both players' sheets to reduce mistakes dramatically.

SourcearXiv AIAuthor: Gerhard Trippen (University of Toronto)
Zugwise: Domain-Aware Game Reconstruction for Digitizing Handwritten Chess Scoresheets
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 26 Oct 2026]

Title:Zugwise: Domain-Aware Game Reconstruction for Digitizing Handwritten Chess Scoresheets

View a PDF of the paper titled Zugwise: Domain-Aware Game Reconstruction for Digitizing Handwritten Chess Scoresheets, by Gerhard Trippen (University of Toronto)

View PDF HTML (experimental)

Abstract:Digitizing handwritten chess scoresheets has been studied as a handwriting-recognition problem: read the move in each box and check that it is legal. This framing misses the errors that matter most. A misread that yields an illegal move is loud. One that yields a legal-but-wrong move is silent, because a legality-only pipeline accepts it and reads every later move against a wrong position. We therefore treat the task as game reconstruction and present Zugwise, which repurposes computer-chess machinery (quiescence search, static exchange evaluation, pin detection) to ask not "what should be played?" but "could a human plausibly have written this?" An absurdity detector makes silent errors loud at or near where they occur, and a backward search traces late symptoms to their cause. Candidate ranking excludes chess-quality signals. A Needleman-Wunsch merge adds the second player's sheet as evidence, and review stops send every disagreement between the sheets' legal readings to a human. In oracle replay of two tournament sections, a release adding them cuts silent errors from 16 to 1 and from 50 to 13. Two learned signals, CTC re-scoring against the recognizer's raw output and a Maia-style human-move prior, raise the correct fix's top-rank rate from 58.8% to 78.0% of the replacement decisions where it is a candidate, and hold without refitting on a later section. On the first section, the human-verified output matches an independent expert transcription move for move on 34 of 45 games, and adjudication against the sheets found errors in both records, on different plies. We do not establish that either workflow is faster or more accurate. The system runs entirely in the browser and is free, private, and offline-capable; alongside it we offer a three-way adjudication protocol for a domain where no single record is ground truth.

Comments: 54 pages, 3 figures. Code and models: this https URL

Subjects:

Artificial Intelligence (cs.AI); Image and Video Processing (eess.IV)

Cite as: arXiv:2611.14544 [cs.AI]

(or arXiv:2611.14544v1 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2611.14544

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Gerhard Trippen [view email] [v1] Mon, 26 Oct 2026 02:06:00 UTC (78 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Zugwise: Domain-Aware Game Reconstruction for Digitizing Handwritten Chess Scoresheets, by Gerhard Trippen (University of Toronto)

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.AI

new | recent | 2026-11

Change to browse by:

cs eess eess.IV

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

InvestorsAdvanced

Key points

  • Treats digitization as game reconstruction rather than handwriting recognition to catch silent legal-but-wrong errors.
  • Uses quiescence search, static exchange evaluation, and pin detection to ask whether a human could plausibly have written a move.
  • Merges both players' scoresheets via Needleman-Wunsch and cuts silent errors from 16 to 1 and 50 to 13 in two tournament sections.
  • Runs entirely in the browser, free, private, offline-capable, and includes a three-way adjudication protocol.

Highlights and analysis are generated automatically and may contain errors. Check the original source.