Karnaugh Map Solver
An interactive Karnaugh map for 2, 3, or 4 variables — click cells to define which input combinations should produce a true output, and the tool computes the minimal sum-of-products boolean expression using the Quine-McCluskey algorithm (prime implicant generation plus essential-implicant selection), the same systematic method a K-map's visual grouping approximates by eye.
Karnaugh maps are a standard technique in digital logic design for simplifying boolean expressions before implementing them as circuits — fewer terms means fewer logic gates. Doing this minimization by hand requires spotting the largest valid groupings of adjacent 1-cells, which gets error-prone past 3 variables. This tool applies the same underlying algorithm computationally so the result is always minimal and correct.
Typical use cases: checking a digital logic homework K-map by hand, minimizing a boolean function before hardware implementation, or exploring how different input patterns simplify differently.
Click cells to toggle them, and the minimized expression updates immediately below the map.