Karnaugh Map Calculator
Minimise a boolean function of up to 4 variables using the Quine-McCluskey method.
Inputs
Indices where function = 1
Minimised SOP
B'C + BC' + AC
Prime Implicants
B'C, BC', AC, AB
Number of Terms
3
Step by step
Values used
Number of Variables (2–4) = 3; Minterms (comma separated indices) = 1, 2, 5, 6, 7
Formula applied
Minimised SOP = sum of essential and selected prime implicants covering all minterms
Minimised SOP
= B'C + BC' + AC
Prime Implicants
= B'C, BC', AC, AB
Number of Terms
= 3
How it works
The Karnaugh map (K-map) is a visual method for boolean function minimisation. This calculator uses the equivalent Quine-McCluskey algorithm: it systematically finds all prime implicants, then selects a minimal covering set to produce the simplest sum-of-products expression.
Formula
Minimised SOP = sum of essential and selected prime implicants covering all minterms
- SOP
- Sum of Products
- minterms
- Input indices where f=1
Frequently Asked Questions
What is a minterm?
A minterm is a product term where every variable appears exactly once (complemented or not). Minterm index i corresponds to the binary encoding of variable values.
Why limit to 4 variables?
K-maps are traditionally drawn for 2–4 variables. Beyond 4, the Quine-McCluskey algorithm still works but the visual map becomes impractical.