Scribd
Upload
27 views21 pages

Backtracking 1

Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, abandoning a partial solution ("backtracking") as soon as it is determined that the solution cannot possibly be completed from that state and returning to try other alternatives. The document provides an overview of backtracking, describing the stages of backtracking, how it is used to search for a goal, the n-queen problem example, promising node pruning, state space trees, and complexity analysis.

Uploaded by

Swapnil Oza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
27 views21 pages

Backtracking 1

Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, abandoning a partial solution ("backtracking") as soon as it is determined that the solution cannot possibly be completed from that state and returning to try other alternatives. The document provides an overview of backtracking, describing the stages of backtracking, how it is used to search for a goal, the n-queen problem example, promising node pruning, state space trees, and complexity analysis.

Uploaded by

Swapnil Oza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

Backtracking

Backtracking is useful
What backtracking is about!
Stages of backtracking
Searching for a goal
Formal algorithm
Formal algorithm
N-Queen Problem
Example of 4-Queen Problem
Promising Node
Informal algorithm
State space Tree
Formal algorithm
Complexity analysis
Sum of subsets
Example state space Tree
Informal Algorithm
Formal algorithm
Complexity analysis

You might also like