Backend
Darmok: Championship Cryptic Crossword Solving via Constraint Tightening and Resilient Orchestration
arXiv cs.DC0 views
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.
Source:https://arxiv.org/abs/2611.13557PreviousRBLA+: Efficient Rank-Specific LoRA Adapter Extraction for Federated Fine-Tuning with Heterogeneous ClientsNextDeterministic, Reproducible Inference in Exact Integer Arithmetic, and Verifiable Distributed Inference as Its Consequence
Related posts
Embodiment-aware control by inference over the operator: a simulation study
0arXiv cs.HC
Shape optimisation of nonlinear Naghdi shells on discrete geometries
0arXiv cs.NA
Decentralized Ranking Aggregation via Gossip: Convergence and Robustness
0arXiv stat.ML
A Distribution Mapping Approach to Counterfactually Fair Reinforcement Learning
0arXiv stat.ML
Minimax Rates and Spectral Distillation for Tree Ensembles
0arXiv stat.ML
TransGHOST: Real-Time, Synthesis-Free Reconstruction of Instrument-Occluded Regions in Ophthalmic Microsurgery
0arXiv cs.RO