My ultimate revenge to the naughty puzzles I couldn't solve as a child.
This repository uses Cafesat, a SAT solver written in Scala. Given a (complex) boolean equation, it tries to find a solution that satisfies it. Most logic based puzzles can be translated to boolean logic and solved this way, as long as the instance size is reasonable.