# Darmok: Championship Cryptic Crossword Solving via Constraint Tightening and Resilient Orchestration DevFeed: [Darmok: Championship Cryptic Crossword Solving via Constraint Tightening and Resilient Orchestration]() Original publisher: [Read original article]() Author: Siddhartha Chatterjee (The University of Texas at Austin) Published: 2026-11-11T05:00:00Z Content type: article Language: en Sources: [arXiv: Artificial Intelligence](), [arXiv: Distributed Computing]() Topics: [Artificial Intelligence](), [AI Architecture](), [Frontier AI](), [reliability-engineering]() Tags: [ai](), [ai-systems](), [architecture](), [crosswords](), [cs-ai](), [cs-cl](), [cs-dc](), [orchestration](), [reliability](), [resilience]() ## AI overview Darmok solved all seven puzzles at the 55th Times Crossword Championship without errors, finishing faster than every human competitor in each round; its Final time was 6m 52s, 3m 13s ahead of the human champion. The system combines rounds of clue cross-checking across three independent models with verified crossing letters, then uses a whole-puzzle model and dictionary lookups to fill gaps without changing confirmed words. This orchestration maintained near-zero-error performance over five months of daily evaluation. Although removing backups and fallbacks barely affected ordinary benchmark accuracy, those paths proved important on difficult operating days and during a severe slowdown of the primary model in the Final. The abstract argues that resilience to worst-case failures becomes central as models handle average cases well. ## Source excerpt arXiv:2611.13557v1 Announce Type: cross 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.