 There are several reasonable alternatives, such as expanding the choice that has the smaller tree.Once a child of the root has been selected (using prove-best or disprove-rest) then the algorithm descends to a leaf node by repeatedly selecting the child that has the highest upper bound.When a leaf node is reached, the algorithm generates all successor nodes and assigns intervals to them using the evaluation function.