Additional Papers: On the Number of Solutions, S(k,n), to a Class of Crossword Puzzle

Geoffrey Harris, John Forster

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Abstract

Upper and lower limit formulae for the total number of solutions to a standard type of crossword puzzle are proposed. The solutions
use words from artificially created lexicons. Formulae are derived for alphabets and square puzzle grids of all sizes and are
compared with the numbers of solutions generated by the implementation of a puzzle solution algorithm.

Note:
In the December 1991 issue of The Computer Journal a new concept of Additional Papers was introduced. Such papers
will have been typeset and given numbered pages in the same way as other papers, but only the title, authorship and
abstract appear in the Journal. To obtain copies of the full paper, readers apply to the editor who will mail copies directly
to the reader at cost. Libraries will be able to obtain bound volumes at the year end. Reprints will be supplied to authors. For further information, including price lists and order forms, readers and libraries should apply directly to the Editor- in-Chief at the address given on the inside front cover of the Journal.
A further list of additional papers is given below.
Original languageEnglish
Pages (from-to)A177-A180
JournalComputer Journal
Volume35
Issue number2
DOIs
Publication statusPublished - 1992
Externally publishedYes

Fingerprint Dive into the research topics of 'Additional Papers: On the Number of Solutions, S(k,n), to a Class of Crossword Puzzle'. Together they form a unique fingerprint.

  • Cite this