BackTraking Algorithm Flashcards

1
Q

BackTraking Algorithm

A

Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point of time (by time, here, is referred to the time elapsed till reaching any level of the search tree).

For example, consider the SudoKo solving Problem, we try filling digits one by one. Whenever we find that current digit cannot lead to a solution, we remove it (backtrack) and try next digit. This is better than naive approach (generating all possible combinations of digits and then trying every combination one by one) as it drops a set of permutations whenever it backtracks.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Naive Algorithm Chess Horse

A

The Naive Algorithm is to generate all tours one by one and check if the generated tour satisfies the constraints.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

BackYtacking Algorithm Chess Horse

A

If all squares are visited
print the solution
Else
a) Add one of the next moves to solution vector and recursively
check if this move leads to a solution. (A Knight can make maximum
eight moves. We choose one of the 8 moves in this step).
b) If the move chosen in the above step doesn’t lead to a solution
then remove this move from the solution vector and try other
alternative moves.
c) If none of the alternatives work then return false (Returning false
will remove the previously added item in recursion and if false is
returned by the initial call of recursion then “no solution exists” )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly