= Complete search algorithm
A <search algorithm> is complete for a specified class of problems if it finds a solution whenever a solution exists in that class. This definition need not require termination on unsolvable instances; an additional termination guarantee should be stated separately. A finite <branching factor> makes <breadth-first tree search> complete for finite-depth solutions, while <depth-first tree search> additionally needs a reason it cannot be trapped on an infinite branch.
Back to article page
