Backtrack programming techniques
- 1 November 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (11) , 651-656
- https://doi.org/10.1145/361219.361224
Abstract
The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten the computation time in many cases. In particular, this technique has allowed the solution of two previously open combinatorial problems, the computation of new terms in a well-known series, and the substantial reduction in computation time for the solution to another combinatorial problem.Keywords
This publication has 5 references indexed in Scilit:
- Estimating the Efficiency of Backtrack ProgramsMathematics of Computation, 1975
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- Backtrack ProgrammingJournal of the ACM, 1965
- A program to solve the Pentomino problem by the recursive use of macrosCommunications of the ACM, 1965