The.Algorithm.Design.Manual.Springer-Verlag.1998

Lecture 11 - backtracking
Backtracking
Backtracking is a systematic way to go through all the possible configurations of a search space.
In the general case, we assume our solution is a vector where each element is selected from a finite
ordered set ,
We build from a partial solution of length k and try to extend it by adding another element. After
extending it, we will test whether what we have so far is still possible as a partial solution.
If it is still a candidate solution, great. If not, we delete and try the next element from :
Compute , the set of candidate first elements of v.
k = 1
While k > 0 do
Listen To Part 11-7
While do (*advance*)
= an element in
if ( ) is solution, print!
k = k + 1
k = k - 1 (*backtrack*)
file:///E|/LEC/LECTUR16/NODE11.HTM (4 of 8) [19/1/2003 1:34:54]
compute , the candidate kth elements given v.
Recursive Backtracking