跳到正文
arXiv cs.AI· Siddhartha Chatterjee (The University of Texas at Austin)·· 2 小时前AI 评分59

Darmok 论文:通过约束收紧与弹性编排实现超人类英式填字游戏解题

Darmok: Championship Cryptic Crossword Solving via Constraint Tightening and Resilient Orchestration

AI 导读

The University of Texas at Austin 的 Siddhartha Chatterjee 发布论文,提出首个在英式密文填字游戏上达到超人类水平的自动化系统 Darmok。

正文 · 原文

View PDF HTML (experimental)

Abstract:We present Darmok, the first automated system to reach superhuman performance on British cryptic crosswords. Unlike American-style crosswords, cryptic clues disguise an unmarked definition and compositional wordplay beneath a misleading surface reading, sparse grids leave nearly half of each word's letters unchecked, and tournament rules rank a grid with even a single wrong or blank square behind all error-free solutions regardless of speed. Competing alongside an elite human field at the 55th Times Crossword Championship in London, Darmok solved all seven championship puzzles error-free and finished faster than every human competitor in every round. It solved the Final puzzle in 6m 52s, a full 3m 13s ahead of the human champion.
Today's frontier AI models can on average solve a whole puzzle in a single try with comparable accuracy and speed. However, cloud API calls still stall, time out, trigger safety refusals, or get stuck in reasoning loops. To simultaneously achieve tournament-grade accuracy, speed, and reliability, Darmok cross-checks clues across three independent models in rounds; uses verified crossing letters to unlock harder clues; and uses a whole-puzzle model and dictionary lookups to fill any remaining gaps without overwriting confirmed words. This design maintained near-zero-error performance across a five-month daily evaluation period. Under normal benchmark conditions, removing backup models, fallback steps, or elaborate prompt instructions barely changes accuracy, making the architecture appear over-engineered. Yet during both the worst days of daily operation and a severe slowdown of our primary model in the live Championship Final, the backup paths carried the solve, showing that as foundation models master the average case, the central challenge in building complex AI systems shifts to resilience in the worst case.
Comments: 60 pages, 10 figures, 15 tables
Subjects: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:2611.13557 [cs.AI]
  (or arXiv:2611.13557v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2611.13557

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Siddhartha Chatterjee [view email]
[v1] Tue, 10 Nov 2026 04:21:44 UTC (1,929 KB)

来源:arXiv cs.AI · arxiv.org