|NU Year||Set: 1.(d) Marks: 5 Year: 2008|
 It is used to find all possible solutions available to the problem.
 It traverse tree by DFS(Depth First Search).
 It realizes that it has made a bad choice & undoes the last choice by backing up.
 It search the state space tree until it found a solution.
 It involves feasibility function.
 It is used to solve optimization problem.
 It may traverse the tree in any manner, DFS or BFS.
 It realizes that it already has a better optimal solution that the pre-solution leads to so it abandons that pre-solution.
 It completely searches the state space tree to get optimal solution.
 It involves bounding function.