IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v59y2008i6p875-886.html
   My bibliography  Save this article

Shannon Meets Shortz: A Probabilistic Model of Crossword Puzzle Difficulty

Author

Listed:
  • Miles Efron

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.

Suggested Citation

  • Miles Efron, 2008. "Shannon Meets Shortz: A Probabilistic Model of Crossword Puzzle Difficulty," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 59(6), pages 875-886, April.
    • Handle: RePEc:bla:jamist:v:59:y:2008:i:6:p:875-886
    DOI: 10.1002/asi.20780
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.20780
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.20780?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamist:v:59:y:2008:i:6:p:875-886. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.