The Design of Backtrack Algorithms.

Gary Loberg · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 1983

The backtrack control structure is a well Known combinatorial problem solving approach in computer science. The strategy can be abstracted into a program schema with slots for lower level functions which is suitable for the automated synthesis of backtrack programs. Employing a Known model of program synthesis based on a problem reduction problem representation, two reduction rules are developed for transforming a problem specification into a backtrack control structure with specifications for lower level functions. We illustrate these rules with sample problems.

Read the paper · More papers on PaperTik