Minimize Boolean expressions with an interactive Karnaugh map and the Quine–McCluskey algorithm. Click cells, paste minterms, or type a truth table. Supports 2 to 5 variables and don't-cares.
Click a cell to cycle 0 → 1 → X (don't-care) → 0.
The tool runs the Quine–McCluskey algorithm to generate all prime implicants, then uses Petrick's method to select a minimal cover of the required minterms. Don't-cares may be included in prime implicants but are never required to be covered. SOP (sum of products) uses 1-minterms; POS (product of sums) is derived from the complement via the same algorithm applied to 0-cells. Input variables are labelled A–E from most significant to least significant bit.