How Backtracking is different from Recursion?

What is Backtracking?

Backtracking is a problem-solving algorithmic technique that involves finding a solution incrementally by trying different options and undoing them if they lead to a dead end. It is commonly used in situations where you need to explore multiple possibilities to solve a problem, like searching for a path in a maze or solving puzzles like Sudoku. When a dead end is reached, the algorithm backtracks to the previous decision point and explores a different path until a solution is found or all possibilities have been exhausted....

Types of Backtracking Problems

Problems associated with backtracking can be categorized into 3 categories:...

How does Backtracking works?

As we know backtracking algorithm explores each and every possible path in order to find a valid solution, this exploration of path can be easily understood via given images: As shown in the image, “IS” represents the Initial State where the recursion call starts to find a valid solution. C : it represents different Checkpoints for recursive calls TN: it represents the Terminal Nodes where no further recursive calls can be made, these nodes act as base case of recursion and we determine whether the current solution is valid or not at this state. At each Checkpoint, our program makes some decisions and move to other checkpoints untill it reaches a terminal Node, after determining whether a solution is valid or not, the program starts to revert back to the checkpoints and try to explore other paths. For example in the above image TN1…TN5 are the terminal node where the solution is not acceptable, while TN6 is the state where we found a valid solution. The back arrows in the images shows backtracking in actions, where we revert the changes made by some checkpoint....

Determining Backtracking Problems:

Generally every constraint satisfaction problem can be solved using backtracking but, Is it optimal to use backtracking every time? Turns out NO, there are a vast number of problem that can be solved using Greedy or Dynamic programming in logarithmic or polynomial time complexity which is far better than exponential complexity of Backtracking. However many problems still exists that can only be solved using Backtracking....

Pseudocode for Backtracking

The best way to implement backtracking is through recursion, and all backtracking code can be summarised as per the given Pseudocode:...

Complexity Analysis of Backtracking

Since backtracking algorithm is purely brute force therefore in terms of time complexity, it performs very poorly. Generally backtracking can be seen having below mentioned time complexities:...

How Backtracking is different from Recursion?

Recursion and Backtracking are related concepts in computer science and programming, but they are not the same thing. Let’s explore the key differences between them:...

Applications of Backtracking

Creating smart bots to play Board Games such as Chess. Solving mazes and puzzles such as N-Queen problem. Network Routing and Congestion Control. Decryption Text Justification...

Must Do Backtracking Problems

N-Queen Problem Solve Sudoku M-coloring problem Rat in a Maze The Knight’s tour problem Permutation of given String...