 In the prove-best strategy, the algorithm selects the node associated with the highest upper bound.The hope is that expanding that node will raise its lower bound higher than any other node's upper bound.The disprove-rest strategy selects the child of the root that has the second-highest upper bound.