Word:

backtracking

(algorithm)backtracking - A scheme for solving a series of sub-problems each of which may have multiple possible solutions and where the solution chosen for one sub-problem may affect the possible solutions of later sub-problems.

To solve the overall problem, we find a solution to the first sub-problem and then attempt to recursively solve the other sub-problems based on this first solution. If we cannot, or we want all possible solutions, we backtrack and try the next possible solution to the first sub-problem and so on. Backtracking terminates when there are no more solutions to the first sub-problem.

This is the algorithm used by logic programming languages such as Prolog to find all possible ways of proving a goal. An optimisation known as "intelligent backtracking" keeps track of the dependencies between sub-problems and only re-solves those which depend on an earlier solution which has changed.

Backtracking is one algorithm which can be used to implement nondeterminism. It is effectively a depth-first search of a problem space.
Translate backtracking to German
Browse
backstage
backstair
Backstairs
Backstay
Backster
Backstitch
Backstop
Backstress
backstroke
backstroker
backswept
backswimmer
Backsword
backtalk
backtick
backtrack
-- backtracking --
backup
Backup Domain Controller
backup file
backup man
backup pumpkin
Backus Normal Form
Backus-Naur Form
Backward
backward analysis
backward and forward
backward chaining
backward combatability
backward compatibility
backward compatible
Backwardation
Backwardly
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy