Additional Papers: An efficient algorithm for crossword puzzle solutions

Geoffrey Harris, Jo Spring, John Forster

Research output: Contribution to journalArticleResearchpeer-review

Abstract

This work investigates the solution of crossword puzzles. A simple pruned tree-search algorithm involving a dynamic dictionary
lookup is detailed and the results of its implementation compared against those already reported in the literature

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)A181-A183
JournalComputer Journal
Volume35
Issue number2
DOIs
Publication statusPublished - 1992
Externally publishedYes

Fingerprint

Costs

Cite this

Harris, Geoffrey ; Spring, Jo ; Forster, John. / Additional Papers: An efficient algorithm for crossword puzzle solutions. In: Computer Journal. 1992 ; Vol. 35, No. 2. pp. A181-A183.
@article{a3797a8df65a4f7f847f3c93c38f0d61,
title = "Additional Papers: An efficient algorithm for crossword puzzle solutions",
abstract = "This work investigates the solution of crossword puzzles. A simple pruned tree-search algorithm involving a dynamic dictionarylookup is detailed and the results of its implementation compared against those already reported in the literatureNote:In the December 1991 issue of The Computer Journal a new concept of Additional Papers was introduced. Such paperswill have been typeset and given numbered pages in the same way as other papers, but only the title, authorship andabstract appear in the Journal. To obtain copies of the full paper, readers apply to the editor who will mail copies directlyto 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.",
author = "Geoffrey Harris and Jo Spring and John Forster",
year = "1992",
doi = "10.1093/comjnl/35.2.188",
language = "English",
volume = "35",
pages = "A181--A183",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "2",

}

Additional Papers: An efficient algorithm for crossword puzzle solutions. / Harris, Geoffrey; Spring, Jo; Forster, John.

In: Computer Journal, Vol. 35, No. 2, 1992, p. A181-A183.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Additional Papers: An efficient algorithm for crossword puzzle solutions

AU - Harris, Geoffrey

AU - Spring, Jo

AU - Forster, John

PY - 1992

Y1 - 1992

N2 - This work investigates the solution of crossword puzzles. A simple pruned tree-search algorithm involving a dynamic dictionarylookup is detailed and the results of its implementation compared against those already reported in the literatureNote:In the December 1991 issue of The Computer Journal a new concept of Additional Papers was introduced. Such paperswill have been typeset and given numbered pages in the same way as other papers, but only the title, authorship andabstract appear in the Journal. To obtain copies of the full paper, readers apply to the editor who will mail copies directlyto 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.

AB - This work investigates the solution of crossword puzzles. A simple pruned tree-search algorithm involving a dynamic dictionarylookup is detailed and the results of its implementation compared against those already reported in the literatureNote:In the December 1991 issue of The Computer Journal a new concept of Additional Papers was introduced. Such paperswill have been typeset and given numbered pages in the same way as other papers, but only the title, authorship andabstract appear in the Journal. To obtain copies of the full paper, readers apply to the editor who will mail copies directlyto 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.

U2 - 10.1093/comjnl/35.2.188

DO - 10.1093/comjnl/35.2.188

M3 - Article

VL - 35

SP - A181-A183

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 2

ER -