Modern SAT solvers
SAT is the problem of deciding whether a formula in boolean logic is satisfiable. What makes SAT interesting is that a variant of it was the first problem to be proven NP-complete.
Understanding SAT by Implementing a Simple SAT Solver in Python
You need a SAT solver when...