2 rows × 4 columns · The first map with real grouping choices
3-Variable Karnaugh Map Solver
Solve any 3-variable Boolean function with automatic grouping, don't-care support, and both SOP and POS output side by side.
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 use this 3-variable karnaugh map solver
Real grouping decisions
Large enough to require genuine judgment about group size and shape, small enough to check by hand.
Wraparound made visible
See exactly how the leftmost and rightmost columns connect — a rule many students miss on paper.
SOP and POS together
Compare both minimized forms for the same function side by side.
Frequently asked questions
How many cells does a 3-variable K-map have?
8 cells (2 cubed), typically laid out as 2 rows by 4 columns using Gray code ordering across the 2-bit axis.
What's the largest possible group in a 3-variable map?
8 cells — the entire map — which only happens when the function is constantly 1.
Does this tool handle don't-cares for 3 variables?
Yes, in every input mode: K-map clicks, truth table, minterms, maxterms, and Boolean expression.