The Map Method
The K-map: a picture of a truth table that makes simplification visual.
Description
A grid representation of a truth table arranged so neighbors differ by one variable. Visual adjacency makes the combining theorem (AB + AB′ = A) obvious. Plot 1s on the map, then circle adjacent groups of size 2ⁿ.
- Squares that touch differ in exactly one variable (Gray ordering).
- Two adjacent 1s combine and cancel that one variable.
- Larger groups (4, 8) cancel more variables.
- What: A grid representation of a truth table arranged so neighbors differ by one variable.
- Why: Visual adjacency makes the combining theorem (AB + AB′ = A) obvious.
- How: Plot 1s on the map, then circle adjacent groups of size 2ⁿ.
- Where: Hand simplification of 2–4 variable functions.
- When: Small functions where a picture beats algebra.
- Analogy — A K-map is a seating chart arranged so that any two neighbours are 'almost identical twins' (differ in one trait). Spotting groups of twins lets you describe them with fewer words.
At a glance
What
A grid representation of a truth table arranged so neighbors differ by one variable.
Why
Visual adjacency makes the combining theorem (AB + AB′ = A) obvious.
How
Plot 1s on the map, then circle adjacent groups of size 2ⁿ.
Where
Hand simplification of 2–4 variable functions.
When
Small functions where a picture beats algebra.
Think of it like…
A K-map is a seating chart arranged so that any two neighbours are 'almost identical twins' (differ in one trait). Spotting groups of twins lets you describe them with fewer words.
Adjacency principle
- Squares that touch differ in exactly one variable (Gray ordering).
- Two adjacent 1s combine and cancel that one variable.
- Larger groups (4, 8) cancel more variables.
Map size by variables
| Variables | Cells | Shape |
|---|---|---|
| 2 | 4 | 2×2 |
| 3 | 8 | 2×4 |
| 4 | 16 | 4×4 |
K-map
▶ live simulatorClick a cell to cycle 0 → 1 → don't-care (×). Minimized SOP updates live.
| 00 | 01 | 11 | 10 | |
|---|---|---|---|---|
| 00 | ||||
| 01 | ||||
| 11 | ||||
| 10 |
1 prime implicant · verified by Quine–McCluskey
The 5 Whys
- 1
Why a map? To turn algebraic combining into spotting neighbors.
- 2
Why Gray ordering? So physical adjacency equals logical adjacency.
- 3
Why group sizes of 2ⁿ? Only those let a full variable cancel.
- 4
Why cancel variables? Fewer literals → fewer gates.
- 5
Root cause: geometry encodes the combining theorem, making minimization visual.
Cheat sheet
Working principle
- Plot 1s on the map, then circle adjacent groups of size 2ⁿ.
- A grid representation of a truth table arranged so neighbors differ by one variable.
Key facts
- Squares that touch differ in exactly one variable (Gray ordering).
Why it exists
- Root cause: geometry encodes the combining theorem, making minimization visual.