The algorithm of binary search, or “chop,” popularized by computer scientists reminds us of the power of subtraction in decision making. Binary chop is the process through which we can identify any specific element within an array of options. By continually dividing a search in half and repeating the process, any unidentified target can be found relatively quickly, as if it was magic.
One might find a similar benefit in reducing the time horizon of a scenario as well.
Never thought about it in terms of eliminating half the potential contributing factors, but that totally makes sense.