Visual Gray-code Boolean minimization
Karnaugh Map Solver
Fill a two-, three-, or four-variable Karnaugh map with 0, 1, and X cells, then inspect exact implicant groups and a minimal Sum-of-Products result.
All entries and results stay in this browser tab. Nothing is uploaded, persisted, placed in the URL, or sent to analytics.
Build the map
Rows and columns use Gray-code order 00, 01, 11, 10. Select any cell to cycle 0 → 1 → X. X means don’t care. Opposite edges are adjacent.
Loading local solver…
Minimal Sum of Products
F =
Minterms:
Don’t cares:
Visible implicant groups
Method
The implementation enumerates prime implicants by exact one-bit combination, then searches covers of every required minterm. It chooses the fewest product terms, then the fewest literals, then a deterministic lexical tie-break. Every non-don’t-care truth-table row is replayed against the selected groups.
Limitations
V1 supports two through four variables, 0/1/X cells, minterms, wraparound adjacency, and minimal SOP only. It excludes five-plus-variable maps, POS, arbitrary Boolean-expression parsing, HDL, circuit diagrams, and timing analysis.
Privacy
No account, server calculation, remote API, fetch, XHR, beacon, cookie, local storage, session storage, IndexedDB, or user-value telemetry is used.