Crossword puzzles as a constraint problem

Anbulagan*, Adi Botea

*Corresponding author for this work

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

    7 Citations (Scopus)

    Abstract

    We present new results in crossword composition, showing that our program significantly outperforms previous successful techniques in the literature. We emphasize phase transition phenomena, and identify classes of hard problems. Phase transition is shown to occur when varying problem parameters, such as the dictionary size and the number of blocked cells on a grid, of large-size realistic problems.

    Original languageEnglish
    Title of host publicationPrinciples and Practice of Constraint Programming - 14th International Conference, CP 2008, Proceedings
    Pages550-554
    Number of pages5
    DOIs
    Publication statusPublished - 2008
    Event14th International Conference on Principles and Practice of Constraint Programming, CP 2008 - Sydney, NSW, Australia
    Duration: 14 Sept 200818 Sept 2008

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume5202 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference14th International Conference on Principles and Practice of Constraint Programming, CP 2008
    Country/TerritoryAustralia
    CitySydney, NSW
    Period14/09/0818/09/08

    Fingerprint

    Dive into the research topics of 'Crossword puzzles as a constraint problem'. Together they form a unique fingerprint.

    Cite this