Backtracking: meaning, definitions and examples

๐Ÿ”™
Add to dictionary

backtracking

 

[ bรฆkหˆtrรฆkษชล‹ ]

Noun
Context #1 | Noun

algorithmic problem-solving

Backtracking is a general algorithm for finding all (or some) solutions to computational problems, particularly constraint satisfaction problems. It incrementally builds candidates to the solutions and abandons a candidate as soon as it is determined that it cannot lead to a valid solution. This technique is particularly useful in scenarios such as puzzles, combinatorial optimization, and various decision-making processes.

Synonyms

exhaustive search, recursion, searching

Examples of usage

  • The programmer used backtracking to solve the maze.
  • Backtracking can effectively find solutions in constraint satisfaction problems.
  • In Sudoku, backtracking allows for finding valid number placements.

Translations

Translations of the word "backtracking" in other languages:

๐Ÿ‡ต๐Ÿ‡น retrocesso

๐Ÿ‡ฎ๐Ÿ‡ณ เคชเคถเฅเคšเคตเคฐเฅเคคเฅ€

๐Ÿ‡ฉ๐Ÿ‡ช Backtracking

๐Ÿ‡ฎ๐Ÿ‡ฉ penelusuran kembali

๐Ÿ‡บ๐Ÿ‡ฆ ะฒั–ะดะบะฐั‚

๐Ÿ‡ต๐Ÿ‡ฑ cofanie

๐Ÿ‡ฏ๐Ÿ‡ต ใƒใƒƒใ‚ฏใƒˆใƒฉใƒƒใ‚ญใƒณใ‚ฐ

๐Ÿ‡ซ๐Ÿ‡ท retour en arriรจre

๐Ÿ‡ช๐Ÿ‡ธ retroceso

๐Ÿ‡น๐Ÿ‡ท geri izleme

๐Ÿ‡ฐ๐Ÿ‡ท ๋ฐฑํŠธ๋ž˜ํ‚น

๐Ÿ‡ธ๐Ÿ‡ฆ ุงู„ุฑุฌูˆุน

๐Ÿ‡จ๐Ÿ‡ฟ zpฤ›tnรฉ sledovรกnรญ

๐Ÿ‡ธ๐Ÿ‡ฐ spรคtnรฉ sledovanie

๐Ÿ‡จ๐Ÿ‡ณ ๅ›žๆบฏ

๐Ÿ‡ธ๐Ÿ‡ฎ nazaj

๐Ÿ‡ฎ๐Ÿ‡ธ afturhvarf

๐Ÿ‡ฐ๐Ÿ‡ฟ ะฐั€ั‚า›ะฐ ัˆะตะณั–ะฝัƒ

๐Ÿ‡ฌ๐Ÿ‡ช แƒฃแƒ™แƒแƒœ แƒ“แƒแƒ‘แƒ แƒฃแƒœแƒ”แƒ‘แƒ

๐Ÿ‡ฆ๐Ÿ‡ฟ geri izleme

๐Ÿ‡ฒ๐Ÿ‡ฝ retroceso

Etymology

The term 'backtracking' in its computational sense has its roots in algorithmic theory and was popularized in the mid-20th century as computer science began to develop as a field. It derives from the concept of 'tracking back' in search processes when an attempted solution path is found to be unfruitful. The word 'track' comes from the Old French 'tracer', meaning to draw or trace, which perfectly encapsulates the method of following a path in search of a solution and then retracing steps when a dead end is encountered. Backtracking is closely related to recursive algorithms in that it relies on the same basic principle of building partial solutions and abandoning them when they fail to meet the problem's constraints. The methodology has since found applications across various disciplines including operations research, artificial intelligence, mathematics, and game theory.