2 Instead, we need to store up popped items in a buffer buf , just as in cube pruning, and enumerate an item only when we are confident that it will never be surpassed in the future.
we would like to have an estimate of the best item not explored yet (analogous to the heuristic function in A* search).