Karnaugh Map Simplifier
Enter minterms (0-15) to get a simplified sum-of-products Boolean expression. Supports up to 4 variables with instant results.
Start using
Karnaugh Map Simplifier
Enter one or more unique or repeated minterm indices from 0 through 15. The tool removes duplicates and infers the smallest variable count, from one through four, that can represent the largest index.
It enumerates valid implicant cubes, keeps implicants that cover only supplied minterms, and chooses a sum-of-products cover with the fewest terms and then the fewest literals.
Variables are named A, B, C and D from the most significant bit to the least. Exclamation means NOT and plus means OR. Minterms 1,3,5,7 infer three variables and simplify to C.
Output shows the inferred variable count, canonical minterm list and simplified expression. Supplying every minterm for the inferred width returns constant 1.
There is no separate variable-count field and no don't-care input, POS form, hazard-free optimization or visual Karnaugh grid. Leading unused variables cannot be preserved because width is inferred.
Structured lists use strict safe integer tokens separated by commas, semicolons or whitespace. Commas are structural separators in every UI language; decimal tokens and embedded nonnumeric text are rejected. Existing per-tool input bounds still apply.
Enter 1–16 integer entries from 0 to 15, separated by commas, semicolons or whitespace; duplicates count toward the 16-entry limit before removal. Ranges such as 0-7 and Boolean expressions are not input syntax. ! before a variable means NOT, adjacent variables mean AND, and + means OR. An empty list is rejected, not constant 0. The constant-1 result omits the canonical list. There is no visual grid or manual variable-width control.
Processing takes place locally in your browser.