Definitions for backtracking
back·track·ing

WikipediaRate this definition:0.0 / 0 votes

1. Backtracking

   Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.The classic textbook example of the use of backtracking is the eight queens puzzle, that asks for all arrangements of eight chess queens on a standard chessboard so that no queen attacks any other. In the common backtracking approach, the partial candidates are arrangements of k queens in the first k rows of the board, all in different rows and columns. Any partial solution that contains two mutually attacking queens can be abandoned. Backtracking can be applied only for problems which admit the concept of a "partial candidate solution" and a relatively quick test of whether it can possibly be completed to a valid solution. It is useless, for example, for locating a given value in an unordered table. When it is applicable, however, backtracking is often much faster than brute-force enumeration of all complete candidates, since it can eliminate many candidates with a single test. Backtracking is an important tool for solving constraint satisfaction problems, such as crosswords, verbal arithmetic, Sudoku, and many other puzzles. It is often the most convenient technique for parsing, for the knapsack problem and other combinatorial optimization problems. It is also the basis of the so-called logic programming languages such as Icon, Planner and Prolog. Backtracking depends on user-given "black box procedures" that define the problem to be solved, the nature of the partial candidates, and how they are extended into complete candidates. It is therefore a metaheuristic rather than a specific algorithm – although, unlike many other meta-heuristics, it is guaranteed to find all solutions to a finite problem in a bounded amount of time. The term "backtrack" was coined by American mathematician D. H. Lehmer in the 1950s. The pioneer string-processing language SNOBOL (1962) may have been the first to provide a built-in general backtracking facility.

WikidataRate this definition:0.0 / 0 votes

1. Backtracking

   Backtracking is a general algorithm for finding all solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c as soon as it determines that c cannot possibly be completed to a valid solution. The classic textbook example of the use of backtracking is the eight queens puzzle, that asks for all arrangements of eight chess queens on a standard chessboard so that no queen attacks any other. In the common backtracking approach, the partial candidates are arrangements of k queens in the first k rows of the board, all in different rows and columns. Any partial solution that contains two mutually attacking queens can be abandoned, since it cannot possibly be completed to a valid solution. Backtracking can be applied only for problems which admit the concept of a "partial candidate solution" and a relatively quick test of whether it can possibly be completed to a valid solution. It is useless, for example, for locating a given value in an unordered table. When it is applicable, however, backtracking is often much faster than brute force enumeration of all complete candidates, since it can eliminate a large number of candidates with a single test.

How to pronounce backtracking?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say backtracking in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of backtracking in Chaldean Numerology is: 2

2. Pythagorean Numerology

   The numerical value of backtracking in Pythagorean Numerology is: 1

Examples of backtracking in a Sentence

1. Adrian Hill:

   We did not exaggerate anything. We're not backtracking at all from the 80 %.

2. Commerce Ministry spokesman Gao Feng:

   The U.S. side has given many labels recently, 'backtracking,' 'betraying,' etc. ... China sets great store on trustworthiness and keeps its promises, and this has never changed.

3. Elisa Giannelli:

   Backtracking on a piece of legislation is potentially really undermining the credibility of what we’ve achieved over the past years, it’s not just about cars. It’s about the political signals that that [dispute] sends.

4. Mariano Rajoy:

   Talking and pledging is very easy but governing is slightly more difficult, the policy reforms that we've implemented have worked, and backtracking would be a blunder. When I see that, with the help of Podemos, the Socialists wants to change everything we've done, I just think it's bad for Spain.

5. Larry Kudlow:

   We were moving well, constructive talks -- and I still think that's the case... but the problem is, two weeks ago in China, there was backtracking by the Chinese.

Popularity rank by frequency of use

References

1. ^ Wikipedia
   https://en.wikipedia.org/wiki/Backtracking
2. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=backtracking