Minimise a boolean function of up to 4 variables using the Quine-McCluskey method.
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.
Minimised SOP = sum of essential and selected prime implicants covering all minterms
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.
K-maps are traditionally drawn for 2–4 variables. Beyond 4, the Quine-McCluskey algorithm still works but the visual map becomes impractical.