A modified and a more efficient implementation of the Walk SAT algorithm that finds out if a Boolean expression is satisfiable and returns a satisfiable assignment. The solver can solve expressions of the order of 2000+ variables.