K-map Solver (3 Variables)
| B'C' | B'C | BC | BC' | |
|---|---|---|---|---|
| A' | 0 | 0 | 0 | 0 |
| A | 0 | 0 | 0 | 0 |
Solution
No solution yet. Fill and solve the K-map.
Learning Resources
What is a K-map?
A Karnaugh map (K-map) is a method to simplify Boolean expressions by grouping adjacent 1s (and don’t-cares) in a 2D grid.
How to Use
- Choose 2–4 variables.
- Click cells to cycle 0 → 1 → X → 0.
- Use “All 0 / All 1 / All X” to quickly fill the table.
- Click “Solve” to get minimal expression.
Tips
- For 3 bits, columns are B"C", B"C, BC, BC", rows are A", A.
- For 4 bits, columns are C"D", C"D, CD, CD"; rows are A"B", A"B, AB, AB".
- Bounding boxes ignore wrap-around edges (though logic is still correct).