Problem solving domain X = maximize fraction
of satisfied clauses in a CNF.

On board: 4 variables.
Types: (1,1) (1,0) (2,2) (2,1) (2,0)

Belief: There is a CNF of type (2,2) (2,1) (2,0) where
you cannot satisfy 80% of the clauses.

Challenge = (Belief, 0.8)

Acceptor will be paid fraction acceptor satisfies.

Belief: There is a CNF of type (1,0) (2,2) where you cannot satisfy
60 % of the clauses.

Two players and administrator.