Brute-force SAT over a truth table — verification instant, search exponential — with the Cook-Levin story of why SAT anchors all of NP.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
SAT & P vs NP Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Brute-force SAT over a truth table — verification instant, search exponential — with the Cook-Levin story of why SAT anchors all of NP. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Hamiltonian Cycle Visualizer: Backtracking search for a cycle through every node exactly once — extensions, dead ends, and the NP-complete reality animated on a real graph.
Open toolTSP Branch & Bound Visualizer: Exact travelling-salesman solving animated: partial tours extend depth-first while the bound prunes any branch that can't beat the best tour found.
Open toolSubset Sum & Partition Visualizer: Boolean DP animated: each number extends every reachable sum, answering subset-sum and equal-partition in pseudo-polynomial time.
Open tool| x | y | z | formula | |
|---|---|---|---|---|
| — | ? | ? | ? | ? |
1SAT — the first NP-complete problem (Cook-Levin): is there a true/false assignment satisfying (x ∨ ¬y) ∧ (y ∨ ¬z) ∧ (¬x ∨ z) ∧ (x ∨ y)? Checking a guess is easy (P-time verify); FINDING one may need all 2ⁿ assignments.
formula in CNF (AND of ORs)for each of 2ⁿ assignments:some clause false → rejectall clauses true → SATISFIABLEP vs NP: can search match verify?
Watch brute-force SAT try assignments: verifying is instant, finding may take exponential search. Cook-Levin makes SAT the anchor every NP problem reduces to.
