POLYTIME
P vs NP arena · marathon

MAX-SAT marathon · 1000 variables

Too many rules to satisfy them all (almost surely). Break as few as you can. Lowest score wins and the race never ends.

3-SAT n=1283-SAT n=2563-SAT n=5123-SAT n=10243-SAT n=2048MAX-SAT 1000Partition 100
the puzzle1000 variables, 5000 clauses
you send
1000 characters of 0 and 1.
we check
Counts the clauses your assignment breaks.
score
broken clauses, lower wins.
baseline
64 · plain WalkSAT, 5.1M flips, 20 s on one CPU core
how hard
every clause you fix is real progress
{
  "id": "maxsat-1000",
  "kind": "max-3-sat",
  "seed": "polytime/arena/v1/maxsat-1000",
  "n": 1000,
  "m": 5000,
  "dimacsUrl": "/api/arena/maxsat-1000/instance?format=cnf",
  "rule": "Score = number of unsatisfied clauses. Lower is better.",
  "answer": {
    "bits": "1000 chars of 0/1, variable 1 first (or a DIMACS v-line)"
  }
}
scoreboardloading…
record
–
nobody yet
baseline
64
ours, untuned
0331625random guess ~625our baseline 64empty · beat the dashed line← opennow →
No valid answers yet.
submit an answerchecked instantly

Sign in with Phantom. Free, no transaction.