An online Karnaugh map simplifier: enter minterms plus optional don't cares and get the minimal sum-of-products, the minimal product-of-sums, a K-map grid and a gate estimate.

One expression per line as "variables; minterms; don't cares (optional)", e.g. A,B,C; 0,2,5,7 or A,B,C; 0,1,2; 3,5. You may also write just the variable count (3; 0,2,5,7) or just the minterms and let the "variables" parameter set the bit width. Switch to the SOP expression mode to type A'B + AC'; the expression is expanded into a truth table first and then simplified.

Simplification runs the Quine-McCluskey algorithm for all prime implicants and then picks a minimum cover with essential prime implicants plus Petrick's method - real K-map simplification, not a lookup table. Every selected implicant is listed with the product term and the minterms it covers. Turning on "show map" draws the grid with Gray-coded rows and columns (2 variables 2×2, 3 variables 2×4, 4 variables 4×4, 5 variables 4×8, 6 variables 8×8); each cell shows its minterm index and value (1 / 0 / X) plus the group numbers it belongs to. At most 6 variables (2^6 = 64 cells) and out-of-range minterm indexes are reported clearly.

Note: this tool focuses on K-map simplification only. Use the Truth Table Generator to expand an expression into a full truth table, and the Boolean Expression Converter to translate between SOP / POS / minterms / maxterms.