M. L. Ginsberg (1993) "Dynamic Backtracking", Volume 1, pages 25-46

PDF | PostScript | doi:10.1613/jair.1
Appendix - containing crossword data

Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this difficulty. The technique developed is a variant of dependency-directed backtracking that uses only polynomial space while still providing useful control information and retaining the completeness guarantees provided by earlier approaches.

Click here to return to Volume 1 contents list