Karnaugh Map Solver LogoKarnaugh Map Solver

Karnaugh Map Solver (K-Map Calculator)

Simplify Boolean functions instantly using K-Maps, truth tables, Boolean expressions, minterms, or maxterms. Get exact SOP/POS results step by step.

How would you like to define your K-map?

Variables
00
01
11
10
00
01
11
10

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

Simplified K-Map Result

Map Groupings

00
01
11
10
00
01
11
10

The function is constant; the entire map or no cells are grouped.

Simplified Expression

F = 0

Original Groups Breakdown

No groups needed (F = 0).
Terms
0
Literals
0
Gates
0

Gate-Level Circuit Diagram

F0GND

Synchronized Truth Table

Updates automatically based on your Karnaugh Map input.

ABCD
m
Output
0000
m0
0001
m1
0010
m2
0011
m3
0100
m4
0101
m5
0110
m6
0111
m7
1000
m8
1001
m9
1010
m10
1011
m11
1100
m12
1101
m13
1110
m14
1111
m15

How it works

From a boolean function to a minimized, gate-level circuit in four steps.

  1. Choose your variables

    Pick 2, 3, 4, or 5 variables to match the boolean function you're minimizing.

  2. Enter your function

    Type a boolean expression, list minterms or maxterms, or fill in the truth table directly.

  3. Read the grouped map

    Pairs, quads, and octets are outlined automatically as the solver finds the largest valid groups.

  4. Get the minimized result

    Copy the simplified SOP or POS expression, view the gate-level circuit, or export a PDF.

What you'll see

A preview of the tool's main views. Scroll to browse.

Karnaugh Map

A gray-code grid with pair, quad, and octet groups outlined directly on the cells.

Truth table input

Cycle every row between 0, 1, and don't-care without leaving the keyboard.

Expression parser

Type boolean notation like AB' + C and see it converted straight into the map.

Circuit diagram

The minimized expression rendered as AND, OR, and NOT gates with routed wires.

Step-by-step trace

Every Quine-McCluskey pass and Petrick's method decision explained in plain language.

Available Languages