# backtracking algorithm

## backtracking algorithm

A formula for solving combinatorial problems such as finding the most efficient airline or delivery route as well as solving crossword puzzles, Sudoku and similar games. The backtracking process abandons each incomplete sequence as soon as it determines that the outcome of continuing this particular logic will not achieve the desired results.
Mentioned in ?
References in periodicals archive ?
Row (3) is the detection and elimination backtracking algorithm, used for detecting and eliminating redundancy related to combining algorithms by backtracking methods in the constructed RBW.
The general backtracking algorithm is similar, except that we only check subsets if they are feasible; that is, if a subset may lead to a solution.
The constructor employs a backtracking algorithm that records some of the possible mutations by testing bead placement during chain growth.
The algorithm can be viewed as a variant of the standard (quadratic-time) backtracking algorithm [Aho and Ullman 1977; Aho et al.
It is instructive to consider the behavior of Figure 1(b) on the example given in the Introduction, which caused the standard backtracking algorithm to exhibit quadratic behavior.
After presenting the quadratic-time backtracking algorithm for the tokenization problem, Waite and Goos advance the following conjecture:
This backtracking algorithm is guaranteed to terminate since there are a finite number of rules and backtracking can occur only once for each new rule.
The boundary backtracking algorithm, notwithstanding the name, actually combines aspects of backtracking and parallel search.
Finally, the boundary backtracking algorithm is reversible, Boundaries support re-starts for natural language generation as well as parsing.
By using a backtracking algorithm with the dawg as our guide, we never consider placing a tile that isn't part of some word on the board (though we might not be able to complete the word).

Site: Follow: Share:
Open / Close