The classic = absolute game can be viewed as using a 
simple secret, like all 0 or all 1 which is determined by the
game configuration.

difference between finding hard problems and hiding secrets.

The objective is to do better than the default.

Check: 
A, !A or !B
default = all true satisfies fraction F(t) for cnf t.
it is difficult to say uniformly, how much better than all
true?
it is easier to say: can always do fraction x.
but can compute how much all true satisfies on worst instances