Search lessons learned from crossword puzzles

Authors:
Matthew L. Ginsberg;Michael Frank;Michael P. Halpin;Mark C. Torrance
Affiliations:
Computer Science Department, Stanford University, Stanford, California;Computer Science Department, Stanford University, Stanford, California;Computer Science Department, Stanford University, Stanford, California;Computer Science Department, Stanford University, Stanford, California
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 3
Cited 6

Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
Experimental evaluation of preprocessing techniques in constraint satisfaction problems

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1

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
STR2: optimized simple tabular reduction for table constraints

Constraints
Solving italian crosswords using the web

AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Cracking crosswords: the computer challenge

Reasoning, Action and Interaction in AI Theories and Systems
DR.FILL: crosswords and an implemented solver for singly weighted CSPs

Journal of Artificial Intelligence Research
Nested rollout policy adaptation for Monte Carlo tree search

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.00

Visualization

Abstract

The construction of a program that generates crossword puzzles is discussed. As in a recent paper by Dechter and Meiri, we make an experimental comparison of various search techniques. The conclusions to which we come differ from theirs in some areas - although we agree that directional arc consistency is better than path-consistency or other forms of lookahead, and that backjumping is to be preferred to backtracking, we disagree in that we believe dynamic ordering of the constraints to be necessary in the solution of more difficult problems.