Computer construction of crossword puzzles using precedence relationships

摘要

This paper reports on the construction of a crossword puzzle generator. After an unsuccessful attempt to construct puzzles by whole insertion, puzzles were successfully constructed by a letter by letter method. A dynamic, heuristically determined, decision structure was required. The constructor resolved questions of letter selection, ordering and reordering of the solution sequence, dictionary structure and access, and decision path selection.