In expert systems, a form of problem solving in which a program tries alternative solutions in an attempt to find the answer. The various alternatives can be viewed as branches on a tree: Backtracking is the programâ€™s ability to follow one branch and, if it reached the end without finding what it seeks, to back up and try another branch.

Is a method for reaching a series of sub-goals. Each sub-goal may have multiple solutions and the solution chosen for each sub-goal may affect the choice of solutions for later goals. To reach the final goal, the computer must first find a solution to the first sub-goal and then, with recursion, attempt solve the other pre-final goals based on this first evaluation. If it is impossible to reach the final goal given the current path, or if all possible solutions are needed, the computer backtracks and tries the next possible solution to its first sub-goal and to its next, etc. It stops backtracking when there are no more paths to traverse.

Proving method which in the event of a failed route in a blind alley returns to the last choice point in the proof tree and checks alternative paths.

Searching process used by Prolog. If a predicate offers multiple clauses to solve a goal, they are tried one-by-one until one succeeds. If a subsequent part of the prove is not satisfied with the resulting variable binding, it may ask for an alternative solution (= binding of the variables), causing Prolog to reject the previously chosen clause and try the next one.

Occurs when a backward chaining process fails after a choice point. The system returns to mthe choice point and continues to test clauses.

Backtracking happens when the internal routines that perform pattern matching head down the wrong path when looking for a pattern. Since the current path-the set of characters being searched-is wrong, a new path needs to be found. Because this process is internal to Perl, you don't need to worry about the details. If you want to know more, please see the documentation that came with your Perl distribution. See also Regular Expression.

Returning to a previous state in a computation in order to try an alternative strategy. In terms of a search tree, backtracking occurs when the end of a branch is reached without a solution being found, and a different branch is chosen.

part of the Prolog search mechanism. The process by which Prolog will attempt to resastisfy goals in the database.

The process of reviewing the goals that have been satisfied and attempting to resatisfy these goals by finding alternative solutions.

A method of searching decision trees in stages, beginning with a depth-first search. The search marks the last decision point and its alternatives. If one search path fails, the system backtracks to the most recent decision point, then follows an alternative branch. This permits searching as small a part of the tree as possible. Most instances of weather forecast expert systems are organized as decision trees, and use backtracking to improve their efficiency.

A control method used to search backwards for solutions.

Backtracking is a special case of brute force search, which searches all possible combinations. http://www.cse.ohio-state.edu/~gurari/course/cis680/cis680Ch19.html#QQ1-51-128 Backtracking algorithms. It can be a strategy for finding solutions to constraint satisfaction problems. The term "backtrack" was coined by American mathematician D.