Free · No sign-up · Runs entirely in your browser

Karnaugh Map Solver

Enter a K-map, truth table, Boolean expression, or minterm/maxterm list for up to 6 variables. Get the exact minimal SOP or POS form — solved with essential prime implicants and Petrick's method — plus the logic circuit it compiles to.

Input
Click a cell: 0 → 1 → X → 0
Karnaugh Map
Minimal Result
Output format
F = 0
Prime Implicant Analysis
Auto-generated Circuit
Universal Gate Conversion

Why this Karnaugh map solver

Up to 6 variables

Standard multi-tile K-maps for 5- and 6-variable functions, not just the 4-variable case most tools stop at.

Exact minimal cover

Essential prime implicants plus Petrick's method for any remaining terms — the same rigor as solving it by hand, done instantly.

Five ways to enter your problem

K-map clicks, truth table, Boolean expression, minterms, or maxterms — all kept in sync automatically, with don't-care support throughout.

Frequently asked questions

How many variables can this Karnaugh map solver handle?

Up to 6 variables, using standard multi-tile K-maps for 5 and 6 variables. Most online K-map tools stop at 5.

Does this give the exact minimal expression, or just a simplified one?

It computes essential prime implicants first, then applies Petrick's method to find the exact minimal cover for any remaining terms — not just a greedy approximation.

Can I enter a Boolean expression instead of clicking the map?

Yes. You can enter minterms, maxterms, a truth table, or a Boolean expression directly, and the map updates automatically.

Does it support don't-care conditions?

Yes, don't-cares are supported in every input mode and are used to help minimize the expression without being required in the output.