 A tree that creates separation at the root contains a proof that the best child is at least as good as any other child.In practice, complex searches might not terminate within practical resource limits.So the algorithm is normally augmented with artificial termination criteria such as time or memory limits.