SAT problems are kind of cool!

While working on fastbrew , I went into the rabbit hole of SAT, short for Boolean satisfiability . It is quite interesting. For my application I am rewriting brew’s package manager to be faster and more reliable, so it does not update dozens of packages every time I install something and it does not break the ones I already use. A Package Manager Puzzle # Let’s start with a real-life scenario to…