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

Siddhartha ChatterjeearXiv 2026 · arXiv

TL;DR

Darmok is the first AI system to achieve superhuman performance on British cryptic crosswords, winning the 2026 Times Crossword Championship by finishing over three minutes ahead of the human champion. Its success stems not just from raw LLM reasoning, but from a "resilient orchestration" architecture designed to maintain zero-error performance even when primary cloud APIs suffer from latency "brownouts" or reasoning loops.

What Problem Does This Paper Address?

Crossword solving has long been a benchmark for AI, but British cryptic crosswords represent a significantly higher bar than American-style puzzles. While American clues are largely semantic queries (e.g., "Capital of Peru" → LIMA), cryptic clues are "dual-grammar" puzzles. They contain a misleading "surface reading" that sounds like a normal sentence, but they also function as a "string program" providing specific instructions (anagrams, deletions, reversals) to construct the answer.

Furthermore, British grids are "topologically sparse," meaning nearly half of the letters are "unchecked" (they don't intersect with another word). In a tournament setting, a single wrong letter ranks you behind every perfect solution, regardless of speed. The challenge is building a system that is both lightning-fast and perfectly accurate, while relying on volatile, heavy-tailed cloud reasoning APIs.

Accuracy vs. Solve Time in the 2026 Championship Final. Darmok (star) sits well ahead of the human field.

Methods

The authors introduce Darmok, a multi-model ensemble that treats crossword solving as an iterative, synchronous constraint-tightening loop. Key technical innovations include:

  • Multi-Seat Orchestration: Darmok queries three independent models (Gemini 3.1 Pro as the "Anchor," Claude Fable 5 as the "Peer," and GPT-5 as the "Third Seat") in parallel.
  • Synchronous Pass Barriers: Instead of "greedy" admission (writing an answer as soon as it's generated), Darmok uses a "rebuild-from-kept" recurrence. At the end of each pass, it clears the grid and only admits answers that are corroborated by multiple models or strongly supported by crossing letters.
  • Jacobi-Style Updates: The system uses a scoring mechanism where words gain "standing" (tentative, supported, or locked) based on agreement with intersecting neighbors. This prevents unvetted guesses from "bootstrapping" each other into the grid.
  • Resilient Failover: A background "Boundary Feed" (GPT-6-astra) attempts to solve the whole puzzle in one shot. If the primary per-clue models stall or time out, these background answers are used as non-evicting backups.
The Darmok architecture, showing the synchronous pass-barrier admission and the iterative constraint-tightening pipeline.

Datasets

The system was evaluated across three primary corpora:

  1. Post-Cutoff Daily Production Record: 132 daily Times puzzles (3,876 clues) published after the training cutoffs of all constituent models to ensure no memorization.
  2. Stratified 16-Puzzle Test Set: 463 clues spanning five difficulty bands (Easy to Extreme) on the community "Snitch" scale.
  3. Mephisto Transfer Set: 10 "barred" puzzles (360 clues) featuring zero black squares and archaic vocabulary from the Chambers Dictionary to test the system's generalization to different grid topologies.

Key Insights and Ideas

  • The "Bitter Lesson" of Resilience: As foundation models master the "average case," the central engineering challenge shifts to the "worst case." Under normal conditions, Darmok’s architecture looks over-engineered. However, during the live Championship Final, the primary Gemini API suffered a 72% drop in token delivery speed. Darmok’s backup paths carried the solve, while a "naive" single-model solver would have timed out.
  • Crossings as the Primary Reasoning Amplifier: The researchers found a "saturation jump" in accuracy. Single-clue solve rates are mediocre (~50%), but once a clue has 3 or more confirmed crossing letters, solve rates jump to >90%.
  • Prompting as a "Brake": Elaborate Chain-of-Thought (CoT) prompting didn't actually improve the models' reasoning accuracy. Instead, requiring a wordplay explanation acted as a "brake" on unverified guessing, converting would-be errors into "clean" timeouts that the system could then handle via failover.

Key Results

  • Superhuman Performance: In the 55th Times Crossword Championship, Darmok solved all 7 puzzles (210 clues) error-free. It cleared the Final in 6m 52s, beating the human champion by 3m 13s.
  • High Reliability: Across the 43-day "frozen" production epoch, Darmok achieved a 95.3% perfect-grid rate and 99.84% clue accuracy.
  • Zero-Shot Generalization: Without any modification, the system achieved 97.2% accuracy on the notoriously difficult Mephisto barred grids, which use a completely different grid geometry.
Accuracy vs. Solve Time in the 2026 Championship Final. Darmok (star) sits well ahead of the human field.

Limitations and Future Work

  • Thematic Meta-Puzzles: The system still struggles with "The Listener" style puzzles, where a prose preamble defines new, puzzle-specific rules (like ciphers or hidden instructions). These require zero-shot synthesis of algorithms rather than just solving clues.
  • The "20-Watt Wetware" Gap: While Darmok is superhuman, it requires megawatts of datacenter compute and high-speed internet. A human champion uses ~20 watts of "biological wetware" and a pencil. Developing a fully local, air-capped solver is the next major systems challenge.
  • Cryptic Setting: Solving is "recognition"; setting (creating) witty, valid cryptic clues is the "Olympus Mons" challenge for LLMs due to the need for simultaneous surface fluency and structural soundness.

Summary updated

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.
BibTeX
@misc{chatterjee2026darmok,
  author = {Siddhartha Chatterjee},
  title = {{Darmok: Championship Cryptic Crossword Solving via Constraint Tightening and Resilient Orchestration}},
  year = {2026},
  eprint = {2611.13557},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.13557},
}
Figure