Karnaugh Map Solver
Simplify Boolean functions with a real minimizer — minimal SOP and POS, optional don’t-cares, and a K-map grid for 2–4 variables. Runs in your browser; free, no signup.
Build the circuit after you simplify
Use the minimal SOP as a prompt for the logic gate maker.
A Karnaugh map (K-map) groups 1s (and X don’t-cares) that differ by one bit so you can read a simpler sum of products. This solver draws the map for 2–4 variables and always computes the cover with Quine–McCluskey, so the algebra is correct even when the visual grouping is ambiguous.
How to use the K-map solver
Choose input mode
Paste minterms (and optional don’t-cares) or a Boolean expression from the truth table generator.
Simplify
The engine lists prime implicants and a minimal cover, then prints SOP and POS.
Read the map
For 2–4 variables, cells show 0, 1, or X in Gray-code order so adjacent cells differ by one bit.
Implement
Copy the minimal SOP into the logic gate maker or Boolean-to-circuit page.
Karnaugh maps and Quine–McCluskey
K-maps shine for up to four variables because Gray-code adjacency matches single-bit changes. Beyond that, the visual map gets crowded; Quine–McCluskey (the tabular method) scales more cleanly and is what this page uses to pick prime implicants and a covering set.
Don’t-cares (X) may be treated as 1 when they help a larger group, but they never appear as required minterms in the cover. The POS result is obtained by minimizing the complement and writing maxterms.
Verify hard homework against your textbook: identical covers can be written with terms in different order; we sort terms for stable output.
Frequently asked questions
Does this Karnaugh map solver actually simplify?
Yes. It runs Quine–McCluskey in your browser and returns minimal SOP/POS, with a K-map grid for 2–4 variables.
Are don’t-cares supported?
Yes. Enter them in the don’t-care field; they may enlarge groups but are not required outputs.
Is it free?
Yes. No signup. The solver is local JS; other FreeDiagram generators use hourly fair-use limits.
K-map vs truth table?
Build the table first if you have an expression, then simplify here. Or jump straight to minterms from your assignment.
Boolean and logic tools
Truth table generator, Boolean-to-circuit, and logic gates.
Truth Table Generator
Type a Boolean expression and get a full truth table instantly — including minterm lists. Free, no signup; computation runs locally in your browser.
Boolean Expression to Logic Circuit
Paste a Boolean expression from your homework and get a clean logic gate diagram: AND, OR, NOT, NAND, NOR, and XOR, with labeled inputs and outputs.
Free AI Logic Gate Diagram Maker
Describe any Boolean logic circuit and FreeDiagram draws the gate diagram instantly — gates, inputs, outputs, and signal flow. Free, hourly fair-use limited, no signup.
Flowchart Symbols and Meanings
A clear chart of the standard flowchart shapes and what each one means, plus free examples you can open and edit. No signup; hourly fair-use limits apply when you generate.