Solving problem SAT with the help of "Stochastic local search" algorithms
In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula. It is a generalization of the Boolean satisfiability problem, which asks whether there exists a truth assignment that makes all clauses true. For more details
In this algorithm, we generate a completely random state, obtain its objective value and report it to the user.
In this algorithm, we try to solve the problem by combining two algorithms Simulated Annealing and Tabu search
