Karnaugh Map — K-Map Simplification Guide

A Karnaugh map, or K-map, is a grid used to simplify a Boolean expression without doing as much algebra by hand. You place the output values from a truth table on the grid, group adjacent $1$s, and then write one simpler term for each group.

The condition matters: K-maps are most practical for small functions, usually with two, three, or four variables. As the number of variables grows, the map becomes harder to read and other methods are usually better.

What A Karnaugh Map Is Showing

A K-map contains the same information as a truth table, but it arranges the cells in Gray-code order instead of ordinary binary order. That arrangement makes neighboring cells differ in exactly one variable.

That one-variable difference is the whole point. If two adjacent cells are both $1$, the changing variable can drop out of the simplified term.

How Grouping Removes Variables

The visual rule comes from Boolean identities such as

$$XY + X\overline{Y} = X$$

The two terms differ only in $Y$, so $Y$ cancels and the shared part $X$ remains. A K-map lets you spot that cancellation pattern directly on the grid.

Karnaugh Map Example

Suppose

$$F(A,B,C) = \sum m(1,3,4,5,7)$$

This means $F=1$ for minterms $1$, $3$, $4$, $5$, and $7$.

For a $3$-variable K-map, use $A$ for the rows and $BC$ for the columns in Gray-code order $00$, $01$, $11$, $10$:

$$\begin{array}{c|cccc} A \backslash BC & 00 & 01 & 11 & 10 \\ \hline 0 & 0 & 1 & 1 & 0 \\ 1 & 1 & 1 & 1 & 0 \end{array}$$

Start with the largest valid group. The four $1$s in the middle two columns form one group. In those four cells, $C=1$ stays fixed while $A$ and $B$ change, so that group simplifies to

$$C$$

One $1$ is still uncovered: minterm $4$, which is $(A,B,C)=(1,0,0)$. Pair it with adjacent minterm $5$, which is $(1,0,1)$.

In that pair, $A=1$ and $B=0$ stay fixed while $C$ changes, so the pair simplifies to

$$A\overline{B}$$

So the simplified expression is

$$F(A,B,C) = C + A\overline{B}$$

That shorter expression is equivalent to the original list of minterms.

Rules For Valid K-Map Groups

Use groups whose sizes are powers of two: $1$, $2$, $4$, $8$, and so on.

Use the largest valid groups you can. Larger groups usually remove more variables.

Remember that the map wraps around. The left and right edges are adjacent, and the top and bottom edges are adjacent.

Diagonal cells are not adjacent.

Overlap is allowed when it helps create a larger or simpler grouping.

Common Karnaugh Map Mistakes

Using Ordinary Binary Order

If you label rows or columns $00$, $01$, $10$, $11$, the adjacency is wrong. K-maps must use Gray-code order so neighboring cells differ by only one bit.

Making Groups Of Three

A group of three cells is never valid. The size must be a power of two.

Missing Wrap-Around Adjacency

Some of the best simplifications use cells on opposite edges of the map. If you forget the wrap-around rule, your answer is often longer than it needs to be.

Forcing Every $1$ Into Exactly One Group

That is not a rule. Reusing a cell can be the best way to create a larger group and a shorter final expression.

When A Karnaugh Map Is Used

K-maps are common in digital logic and introductory computer engineering because they turn Boolean simplification into a visual process. They are especially useful when you want a simpler sum-of-products expression before drawing or implementing a logic circuit.

They are also good for intuition. Even if software handles larger designs, learning K-maps makes it easier to see why certain Boolean terms combine and others do not.

Try A Similar Problem

Try simplifying $F(A,B,C)=\sum m(0,2,4,6,7)$ on your own. Draw the map, make the largest valid groups first, and then keep only the variables that stay constant in each group.

If you want to go one step further, try a version with don't-care values and use them only when they help you make a larger valid group.