Generation of solution sets for unconstrained crossword puzzles

Geoffrey Harris

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

3 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 languageEnglish
Title of host publicationProceedings of the 1990 Symposium on Applied Computing
PublisherIEEE Computer Society
Pages214-219
ISBN (Electronic)0-8186-2031-5
DOIs
Publication statusPublished - 1990
Externally publishedYes

Fingerprint Dive into the research topics of 'Generation of solution sets for unconstrained crossword puzzles'. Together they form a unique fingerprint.

Cite this