3 Variable K-Map Examples
A 3-variable (i.e., A, B, C) Karnaugh Map (K-Map) is used to simplify Boolean expressions. It has 8 cells, where each cell represents one possible minterm (i.e., m₀) or maxterm (i.e., M₀).

Solving 3 Variable K-Map examples helps students understand how to place minterms and maxterms, group adjacent values, and simplify Boolean expressions using SOP and POS methods.
Minterms and Maxterms in 3 Variable K-Map
Minterms and maxterms represent all possible combinations of three variables (A, B, and C) and are used to simplify Boolean expressions in SOP (Sum of Products) and POS (Product of Sums) forms using a 3 Variable K-Map.
Minterms 3 Variable K-Map – SOP
A 3-variable K-Map for minterms is used to simplify Boolean expressions in Sum of Products (SOP) form. It uses 1s to represent the given minterms, which are grouped together to obtain the simplified Boolean expression. The following diagram explains the minterms of a 3-variable K-map

Minterms of three variables:
-
m₀ = 000 = A’B’C’
-
m₁ = 001 = A’B’C
-
m₂ = 010 = A’BC’
-
m₃ = 011 = A’BC
-
m₄ = 100 = AB’C’
-
m₅ = 101 = AB’C
-
m₆ = 110 = ABC’
-
m₇ = 111 = ABC
Maxterms 3 Variable K-Map – POS
A 3-variable K-Map for maxterms is used to simplify Boolean expressions in Product of Sums (POS) form. It uses 0s to represent the given maxterms, which are grouped together to obtain the simplified Boolean expression. The following diagram explains the maxterms of a 3-variable K-map

Maxterms of three variables:
-
M₀ = 000 = A + B + C
-
M₁ = 001 = A + B + C’
-
M₂ = 010 = A + B’ + C
-
M₃ = 011 = A + B’ + C’
-
M₄ = 100 = A’ + B + C
-
M₅ = 101 = A’ + B + C’
-
M₆ = 110 = A’ + B’ + C
-
M₇ = 111 = A’ + B’ + C’
Rules for Solving 3 Variable K-Map Examples
Follow these rules when solving 3 Variable K-Map examples:
-
Draw a 2 × 4 K-Map containing eight cells.
-
Arrange the columns in Gray code order (00, 01, 11, 10).
-
Identify the given minterms or maxterms.
-
For SOP, place 1 in the cells of the given minterms and 0 in the remaining cells.
-
For POS, place 0 in the cells of the given maxterms and 1 in the remaining cells.
-
Make the largest possible groups of adjacent 1s for SOP or adjacent 0s for POS.
-
Groups can contain 1, 2, 4, or 8 cells.
-
Diagonal cells cannot be grouped together.
-
The first and last columns are adjacent, so wrap-around grouping is allowed.
-
Groups can overlap when it helps simplify the Boolean expression.
-
Write the simplified Boolean expression using the common variables in each group.