The 3SAT Puzzle Game
The 3SAT problem, as a game. SAT is the first problem to be proven NP-complete, see the Cook-Levin theorem. The P vs. NP problem, often considered to be the most important unsolved problem in computer science, asks whether or not all NP-complete problems (such as 3SAT) can be solved in polynomial time.
Comments
Log in with itch.io to leave a comment.
maybe make it so that the numbers use different colors than the good/bad indicators
also it doesn't tell you when you win
I made them all good and I was rewarded with nigh a sliver of dopamine. No victory screen no nothing. 3/5 would click on the buttons again.