Special thanks to @tombh for proofing this blog post! Edit 5/28: added a link to the repo and corrected the solver I used Did you know that LinkedIn has games? I sure as hell didn’t until my Dad showed me that they in fact have 5 (!) different games that you can play. One of them stood out to me as somewhat interesting, Queens: Solved Queens board| Ryan Berger's Page
Hi, I'm Hillel. This is the newsletter version of my website. I post all website updates here. I also post weekly content just for the newsletter, on topics like Formal Methods Software History and Culture Fringetech and exotic tooling The philosophy and theory of software engineering You can see the archive of all public essays here.| buttondown.com
A common assumption I see on the ‘net is that NP-complete problems are impossible to solve. I recently read that dependency management in Python is hard because package resolution is NP-complete. This is true in principle, but the reality is more complicated. When we say “NP-complete is hard” we’re talking about worst-case complexity, and the average-case complexity is often much more tractable. Many industry problems are “well-behaved” and modern SAT solvers can solve them quickly.| Hillel Wayne
