The design of backtrack algorithms.
Loading...
Authors
Loberg, Gary
Subjects
backtrack algorithms
program synthesis
control structure abstraction
problem reduction
state space search
graph search
program synthesis
control structure abstraction
problem reduction
state space search
graph search
Advisors
Smith, Douglas R.
Date of Issue
1983-06
Date
June 1983
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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.
Type
Thesis
Description
Series/Report No
Department
Computer Science
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.