- (backtrack) retrace one's course; "The hikers got into a storm and had to turn back"
- Backtracking is a general algorithm for finding all (or some) solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c ("backtracks") as soon as it determines that c cannot possibly be completed to a valid solution.
- BackTrack is a GNU/Linux distribution distributed as a Live DVD aimed at forensics use and penetration testing.
- (Backtrack (film)) Catchfire is a 1990 action-thriller-drama film starring Jodie Foster, Dennis Hopper, and Fred Ward. Several other notable actors have cameos. The film was disowned by its director, Hopper, before release and he is therefore credited under the fictional pseudonym Alan Smithee. ...
- (BackTrack (magazine)) BackTrack is a monthly magazine, published by Pendragon Publishing, concentrating on researched articles and photographic features about British and Irish railway history. ...
- (Backtrack (western novel)) Backtrack is a western novel by Milton Lott, published in 1965. The book is about a cattle drive from Texas to Montana, and features cowboy Ringo Rose and a Mexican boy whom he fathers. He teaches the kid skills he needs to survive, including gunfighting. ...
- (Backtracks (AC/DC album)) Backtracks is a box set by Australian hard rock band AC/DC. It was announced on September 29, 2009 and was released on November 10, 2009 . This is a collection of the band's studio and live rarities together in one boxset. ...
- (Backtracks (Poco)) Backtracks is a compilation album by the American Country rock band Poco, released in 1982.
- (backtrack) the act of backtracking; to retrace one's steps; to repeat or review work already done; To taxi down an active runway in the opposite direction to that being used for takeoff
- (Backtrack) A spoken or written review or summary of information, usually to build/maintain rapport and to invite revision or correction.
- (Backtrack) The outer, stationary rim of the roulette wheel where the ball is spun. Also called the ball-track.
- (BACKTRACK) A boolean read-only variable. If true (ie a value of 1), this indicates that the current page was returned to as a result of using the Back.asp pseudopage mechanism. ...
- (Backtrack) A review, both verbal and non-verbal, of the last portion of a discussion, presentation or set of instructions.
- (Backtrack) Navigation of a route in reverse order from the last position fix in succession to the first. Reverse of navigating a route in normal sequence.
- (Backtrack) The act of turning around and retracing your path in a Maze. You can either be forced to backtrack (like when a dead end is reached) or just choose to do so. This can refer to the actions of a person or a computer algorithm in navigating a Maze.
- (Backtrack) To review what you have already learned.
- (backtrack) going back and looking for trail signs when a party is lost or in doubt with path
- (backtrack) in a tree search, to move back from the node currently being examined to its parent.
- The practice of saying, "If I had to do it all over, I'd do it differently," and then actually going back and doing it all over differently. Mathematically speaking, it's returning from an unsuccessful recursion on a tree of possibilities. ...
- A programming technique in which the program tries one possible solution to a problem, but tries a different solution if the first isn't successful.
- In order to make parse tables more compact and parsers faster, it is common to use default reductions. In case of error, it is necessary to undo default reductions before diagnostics can be properly determined. In AnaGram, this undo operation is called backtracking.
- The process of retracing your path in a maze. This happens when you reach a dead end and have to turn around, or if you have followed a passage that leads you back to an area of the maze you have already traversed.
- If a sub-goal fails, the built-in Prolog search mechanism will go back to the parent-goal. Any variables that were instantiated in the sub-goal will be un-instantiated. Prolog will then search for a new way of satisfying the sub-goal. This process is called backtracking.
- 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.
- is a general algorithm that, given a descent direction, will seek the increment , minimizing the residual.