As Minimax search proceeds, we could mark each node with an inequality, max at an OR node or min at an AND node, representing that the final value is bounded by the values seen so far.
If two nodes in the hierarchy have incompatible inequalities (no possible overlap), then we know that the node below will not be chosen, and we can stop search.
