Shannon meets shortz: A probabilistic model of crossword puzzle difficulty

Miles Efron

Research output: Contribution to journalArticlepeer-review

Abstract

This article is concerned with the difficulty of crossword puzzles. A model is proposed that quantifies the difficulty of a Puzzle P with respect to its clues. Given a clue-answer pair (c,a), we model the difficulty of guessing a based on c using the conditional probability P(a|c); easier mappings should enjoy a higher conditional probability. The model is tested by two experiments, each of which involves estimating the difficulty of puzzles taken from The New York Times. Additionally, we discuss how the notion of information implicit in our model relates to more easily quantifiable types of information that figure into crossword puzzles.

Original languageEnglish (US)
Pages (from-to)875-886
Number of pages12
JournalJournal of the American Society for Information Science and Technology
Volume59
Issue number6
DOIs
StatePublished - Apr 2008

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Human-Computer Interaction
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Shannon meets shortz: A probabilistic model of crossword puzzle difficulty'. Together they form a unique fingerprint.

Cite this