https://www.hillelwayne.com/tags/sat/ Recent content in Sat on Hillel Wayne Hugo -- gohugo.io en-us Mon, 20 Feb 2023 00:00:00 +0000 https://www.hillelwayne.com/post/np-hard/ Mon, 20 Feb 2023 00:00:00 +0000 https://www.hillelwayne.com/post/np-hard/ 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. https://www.hillelwayne.com/post/sudoku/ Sun, 10 Oct 2021 00:00:00 +0000 https://www.hillelwayne.com/post/sudoku/ A Sudoku Puzzle is a famous Japanese puzzle. In it you solve a 9 by 9 grid of numbers, but you don’t need to do any math to solve the sudoku puzzle! In each number you put a row and column, and also a number in each box. We will solve the Sudoku Puzzle with programming, by writing a program that solves the Sudoku Puzzle. This can be done in any programming language.