K-Map Solver (Karnaugh Map)

Simplify Boolean expressions using Karnaugh maps. Enter minterms or a Boolean expression to get the minimized SOP form.

Number of Variables

Input Method

Minterms (1, 2, 3, 4...)

Enter minterm numbers separated by commas (e.g., 0,1,2,3) or ranges (e.g., 0-3,5,7)

Don't Cares (Optional)

Optional: Enter don't care conditions

Boolean Expression

Use: ' for NOT, + for OR, * or nothing for AND. Example: A'B + AB'

Click on output cells to toggle between 0, 1, and X (don't care)

Karnaugh Map

Simplified Expression (SOP)

Simplified Expression (POS)

Summary

Minterms:	-
Don't Cares:	-
Groups Found:	-
Literals Saved:	-

Step-by-Step Solution

Enter minterms or a Boolean expression, then click "Simplify Expression" to see the step-by-step solution.

What is a Karnaugh Map?

A Karnaugh Map (K-Map) is a graphical method for simplifying Boolean algebra expressions. It arranges truth table values in a grid where adjacent cells differ by only one variable, making it easy to identify and eliminate redundant terms.

How to Read the K-Map

2 Variables: 2x2 grid (4 cells) - Variables: A, B
3 Variables: 2x4 grid (8 cells) - Variables: A, B, C
4 Variables: 4x4 grid (16 cells) - Variables: A, B, C, D
1 = True, 0 = False, X = Don't Care
Group adjacent 1's in powers of 2 (1, 2, 4, 8, 16)

K-Map Rules

Groups must be rectangular
Groups can wrap around edges
Larger groups = simpler expression
Every 1 must be in at least one group
Don't cares (X) can be used as 1 or 0