बैक ट्रैकिंग
Sign in to saveAlso known as Backtracking Algorithm, Backtracking Algorithms
Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction or enumeration 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.
In the Vinony graph
Within Vinony's link graph, बैक ट्रैकिंग is referenced by 154 other articles, and connects out to Sudoku solving algorithm, Amsterdam and chess.
It sits within the topics Pattern matching and Search algorithms.
Its subject is documented across 28 Wikipedia language editions.
Research
957 papers- Backtracking metabolic dynamics in single cells predicts bacterial replication in human macrophages.Nature communications · 2025
- Persistence of backtracking by human RNA polymerase II.Molecular cell · 2024
- Backtracking childhood leukaemia to birth: A battle of addition.British journal of haematology · 2024
- A role for human senataxin in contending with pausing and backtracking during transcript elongation.Molecular cell · 2025
- Persistence of backtracking by human RNA polymerase II.bioRxiv : the preprint server for biology · 2023
via PubMed
Wikidata facts
- Subclass of
- search algorithm
- Image
- Depthfirst.png
Show 4 more facts
- Commons category
- Backtracking
- ACM Classification Code (2012)
- 10011255
- maintained by WikiProject
- WikiProject Mathematics
- P13411
- Sistine Chapel
Sources (2)
via Wikidata · CC0
Gallery (2)
Connections
Sudoku solving algorithm
Entity
Amsterdam
Entity
chess
Entity
International Standard Book Number
Entity
algorithm
Entity
central processing unit
Entity
sudoku
Entity
queen
Entity
data structure
Entity
crossword
Entity
Prolog
Entity
puzzle
Entity
sorting algorithm
Entity
mathematical optimization
Entity
stack
Entity
hash function
Entity
array data structure
Entity
logical conjunction
Entity
chessboard
Entity
binary search algorithm
Entity