Crossword Puzzles as a Constraint Problem

Authors:
Anbulagan;Adi Botea
Affiliations:
NICTA and Australian National University, Canberra, Australia;NICTA and Australian National University, Canberra, Australia
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 5
Cited 0

Scaling Effects in the CSP Phase Transition

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Constraint Programming Lessons Learned from Crossword Puzzles

AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Generalized nogoods in CSPs

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results

Journal of Artificial Intelligence Research
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.