Alice Challenge: 
There exists a Boolean CSP problem P using only relations R 
s.t. for all solutions SBob searched by the opponent Bob in T seconds:    
Quality(P, SBob) < Price * Quality(P, SAlice).
Price (in [0,1]) is the price of the challenge and it expresses how close
to Alice' secret solution SAlice agent Bob must come for Bob to win.