backtracking SAT solver
I was taking a course on Algorithms โ learning about SAT solvers, amazed and curious how they're optimizated. The easiest optimization is to backtrack the solution search tree, which is what this implementation does. There is a lot of literature on other techniques.
This solver is a very readable implemention of a backtracking SAT solver written in JavaScript (ES6).