Search Lessons Learned from Crossword Puzzles

Proceedings of the 8th National Conference on Artificial Intelligence, AAAI 1990

Volumn , Issue , 1990, Pages 210-215

  Ginsberg, Matthew L ^a   Frank, Michael ^a   Halpin, Michael P ^a   Torrance, Mark C ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARC CONSISTENCY; CROSSWORDS PUZZLES; DYNAMIC ORDER; EXPERIMENTAL COMPARISON; PATH CONSISTENCY; SEARCH TECHNIQUE;

EID: 84886020812     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Rina Dechter. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artificial Intelligence, 1990. To appear.
2. Rina Dechter and Itay Meiri. Experimental evaluation of preprocessing techniques in constraint satisfaction problems. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 271-277, 1989.
3. Rina Dechter and Judea Pearl. Network-based heuristics for constraintsatisfaction problems. Artificial Intelligence, 34:1-38, 1988.
4. John Gaschnig. Performance Measurement and Analysis of Certain Search Algorithms. Technical Report CMU-CS-79-124, Carnegie-Mellon University, 1979.
5. Lawrence J. Mazlack. Computer construction of crossword puzzles using precedence relationships. Artificial Intelligence, 7:1-19, 1976.
6. R. M. Stallman and G. J. Sussman. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9 (2):135-196, 1977.