Suppose you have two deterministic algorithms:

Algorithm 1 splits the search space into partitions of size 1/4 and 3/4.

Algorithm 2 splits the search space into partitions of size 1/2 and 1/2.

When going up against an adversary, which would you prefer and why?

o Both algorithms have the same expected results.

o Algorithm 1, because there is a chance that you will get the 1/4 partition, greatly narrowing your search space.

o Algorithm 2, because splitting the search space unevenly causes branches that are impossible to analyze.

o Algorithm 2, because 1/2 is the best you can do against an adversary.