Play it while it's hot: SAT or NOT. 

The first frame game where *you* figure out if a random 3SAT instance is satisfiable (or not).

Play it while it's hot: SAT or NOT. 

The first frame game where *you* figure out if a random 3SAT instance is satisfiable (or not).

https://sat-or-not.onrender.com

Did 6 in a row they were all to SAT? Are you using the classic random 3-sat phase transition parametrization to make things hard? (Might not work for tiny instances...) I used to geek out on algos for SAT solving.

If you play a couple rounds, you will quickly realize that almost every generated problem is SAT (spoiler alert I guess). My intention was to generate 50-50 SAT/UNSAT, but it would actually require a lot more clauses. 18 to be exact, not very game like.

Good catch! I was trying to play around the phase transition parameters, but even with just 3 variables it was unplayable 🙃 

I even relaxed the generation rules, literally everything is SAT if you only pick distinct variables

Eng @ Coinbase, working on Base
https://bayardo.org

Good catch! I was trying to play around the phase transition parameters, but even with just 3 variables it was unplayable 🙃 

I even relaxed the generation rules, literally everything is SAT if you only pick distinct variables

https://warpcast.com/karma/0xf43869e5

"literal regular" instances typically need fewer clauses for unsatisfiability, in case you care, though not sure how things are for tiny instances. Did NOT expect to be bringing up that result today if ever! https://bayardo.org/ps/cp96.pdf