Jump to ContentJump to Main Navigation
The Mathematics of Various Entertaining SubjectsResearch in Recreational Math$
Users without a subscription are not able to see the full content.

Jennifer Beineke and Jason Rosenhouse

Print publication date: 2015

Print ISBN-13: 9780691164038

Published to Princeton Scholarship Online: October 2017

DOI: 10.23943/princeton/9780691164038.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in HSO for personal use (for details see http://www.universitypressscholarship.com/page/privacy-policy).date: 17 July 2018

Analysis of Crossword Puzzle Difficulty Using a Random Graph Process

Analysis of Crossword Puzzle Difficulty Using a Random Graph Process

Chapter:
(p.105) 8 Analysis of Crossword Puzzle Difficulty Using a Random Graph Process
Source:
The Mathematics of Various Entertaining Subjects
Author(s):

John K. McSweeney

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691164038.003.0008

This chapter quantifies the dynamics of a crossword puzzle by using a network structure to model it. Specifically, the chapter determines how the interaction between the structure of cells in the puzzle and the difficulty of the clues affects the puzzle's solvability. It first builds an iterative stochastic process that exactly describes the solution and obtains its deterministic approximation, which gives a very simple fixed-point equation to solve for the final solution proportion. The chapter then shows via simulation on actual crosswords from the Sunday edition of The New York Times that certain network properties inherent to actual crossword networks are important predictors of the final solution size of the puzzle.

Keywords:   crossword puzzles, crossword puzzle difficulty, random graph process, network structure, iterative stochastic process, The New York Times, network properties, crossword networks

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.