Generation of solution sets for unconstrained crossword puzzles

Geoffrey Harris

doi:10.1109/SOAC.1990.82171

Generation of solution sets for unconstrained crossword puzzles

Geoffrey Harris

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

5 Citations (Scopus)

Abstract

An unconstrained crossword puzzle is one for which only the puzzle grid dimensions and the relevant dictionary are known. An algorithm to provide solutions for such an unconstrained crossword puzzle must, therefore, determine not only the locations of words in the word slots, as in the constrained problem, but also the positioning of the word slots themselves and, by implication, the location of the black squares. The implementation of such an algorithm is presented and demonstrated to be successful.

Original language	English
Title of host publication	Proceedings of the 1990 Symposium on Applied Computing
Publisher	IEEE Computer Society
Pages	214-219
ISBN (Electronic)	0-8186-2031-5
DOIs	https://doi.org/10.1109/SOAC.1990.82171
Publication status	Published - 1990
Externally published	Yes

Access to Document

10.1109/SOAC.1990.82171

Cite this

@inproceedings{903993cc1015466a8854c7162538a011,

title = "Generation of solution sets for unconstrained crossword puzzles",

abstract = "An unconstrained crossword puzzle is one for which only the puzzle grid dimensions and the relevant dictionary are known. An algorithm to provide solutions for such an unconstrained crossword puzzle must, therefore, determine not only the locations of words in the word slots, as in the constrained problem, but also the positioning of the word slots themselves and, by implication, the location of the black squares. The implementation of such an algorithm is presented and demonstrated to be successful.",

author = "Geoffrey Harris",

year = "1990",

doi = "10.1109/SOAC.1990.82171",

language = "English",

pages = "214--219",

booktitle = "Proceedings of the 1990 Symposium on Applied Computing",

publisher = "IEEE Computer Society",

address = "United States",

}

TY - GEN

T1 - Generation of solution sets for unconstrained crossword puzzles

AU - Harris, Geoffrey

PY - 1990

Y1 - 1990

N2 - An unconstrained crossword puzzle is one for which only the puzzle grid dimensions and the relevant dictionary are known. An algorithm to provide solutions for such an unconstrained crossword puzzle must, therefore, determine not only the locations of words in the word slots, as in the constrained problem, but also the positioning of the word slots themselves and, by implication, the location of the black squares. The implementation of such an algorithm is presented and demonstrated to be successful.

AB - An unconstrained crossword puzzle is one for which only the puzzle grid dimensions and the relevant dictionary are known. An algorithm to provide solutions for such an unconstrained crossword puzzle must, therefore, determine not only the locations of words in the word slots, as in the constrained problem, but also the positioning of the word slots themselves and, by implication, the location of the black squares. The implementation of such an algorithm is presented and demonstrated to be successful.

U2 - 10.1109/SOAC.1990.82171

DO - 10.1109/SOAC.1990.82171

M3 - Conference contribution

SP - 214

EP - 219

BT - Proceedings of the 1990 Symposium on Applied Computing

PB - IEEE Computer Society

ER -

Generation of solution sets for unconstrained crossword puzzles

Abstract

Access to Document

Fingerprint

Cite this