 The hope is that by expanding that node you might be able to reduce the upper bound to less than the lower bound of the best child.Note that applying the disprove-rest strategy is pointless until the lower bound of the child node that has the highest upper bound is the highest among all lower bounds.The original algorithm description did not give any further guidance on which strategy to select.