Free tool · No sign-up · Runs in your browser
Karnaugh Map Solver
Paste minterms (and optional don't-cares) for a 2-, 3-, or 4-variable boolean function. The minimal sum-of-products expression is computed deterministically via Quine-McCluskey, no LLM, no rate limit, no telemetry beyond standard page analytics.
| CD \ AB | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 00 | 10 | 04 | 012 | 18 |
| 01 | 01 | 15 | 113 | 09 |
| 11 | 03 | 17 | 115 | 011 |
| 10 | 12 | 06 | 014 | 110 |
How to read the K-map
Rows and columns are labelled in Gray code (00, 01, 11, 10) so any two adjacent cells differ in exactly one bit. The minimum sum-of-products groups the largest possible power-of-two block of 1s, replacing each eliminated variable with its complement-free term.
What Quine-McCluskey does
Quine-McCluskey is the textbook deterministic algorithm for boolean minimisation. It enumerates all prime implicants by pairwise comparison and reduction, then uses a prime-implicant chart to pick the minimal cover. We run it in JavaScript in your browser, no server call, no LLM hallucination risk, identical answer every time.
Need help understanding the steps?
The chat-version of this tool (@kmap inside EveChat) explains the grouping reasoning alongside the answer. Useful for digital-logic homework where you need to show the implicants you covered. Open in EveChat
