Enter your Number of Variables, Minterms, and any Don't Care Terms into the Karnaugh Map Calculator, and it'll group the cells and solve the Simplified Boolean Expression for you — along with the Number of Groups, Expression Reduction, and Original Terms Count so you can see exactly how much the logic shrank.
Simplified Boolean Expression
--
Number of Groups
--
Expression Reduction
--
Original Terms Count
--
Don't Care conditions (represented by X) are input combinations where the output value doesn't matter - it can be either 0 or 1. These provide flexibility in grouping terms to achieve maximum simplification of the Boolean expression.
SOP (Sum of Products) expresses the function as OR of AND terms, focusing on when the output is 1. POS (Product of Sums) expresses it as AND of OR terms, focusing on when the output is 0. Choose based on which gives a simpler expression.
Enter minterms as decimal numbers separated by commas (e.g., 0,1,3,7). Each number represents a row in the truth table where the output should be 1. For a 3-variable map, valid minterms are 0-7.
The calculator supports Karnaugh maps for 2 to 6 variables. Maps with more than 4 variables become complex to visualize but can still be solved using the Quine-McCluskey method for optimization.
The calculator automatically identifies the largest possible groups of adjacent 1s (and don't cares) that are powers of 2 in size (1, 2, 4, 8, etc.). These groups minimize the number of literals in the final simplified expression.
Yes, you can specify custom variable names in the Variable Names field. Enter them as comma-separated values (e.g., X,Y,Z or P,Q,R). The calculator will use these names in the simplified expression.
The calculator uses standard Karnaugh map grouping algorithms to find the minimal sum-of-products or product-of-sums expressions. The results are mathematically correct for educational and verification purposes.