MAX 10-SAT Algorithm The MAX k-SAT problem is:


  “Given a set of clauses C1,…,Ck, each of length k, over a set of
  variables x1,…,xn, find a truth assignment that satisfies as many of
  the clauses as possible.”


I'm trying for find a randomized 0.999-approximation algorithm for the MAX 10-SAT problem. Help :(
Try choosing a random assignment.