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.

Lulling someone into a state of vulnerability through monotony; see redundancy

Backtracking is the process of undoing parsing actions, usually because a syntax error occurs. LR parsers do not usually do this. It is a process required by some older parsing techniques. It is undesirable.

Completion of a lower-level or prerequisite course after (or while) taking an advanced course. Additional credit and grade points are not awarded for lower-level courses if they are taken after or concurrently with the advanced course for which they are explicitly or implicitly prerequisites.

See WEAPON BACKTRACKING.

control backtracking or data backtracking; usually used as a synonym for the former.

to go back and cover material again.