Fig. 6: Schematic search tree of the complete differencing algorithm.

Orange branch leads to the perfect solution, which has the best possible discrepancy of 1. If the algorithm searches from left to right, as shown here, then it will terminate after searching the first branch since the perfect solution will be found, and all other branches will be discarded.