2-Variable Karnaugh Map Solver
Solve any 2-variable Boolean function instantly. Ideal for seeing exactly how two adjacent 1s combine into a single simplified term before moving to larger maps.
Why use this 2-variable karnaugh map solver
Learn the fundamentals
The smallest possible K-map, perfect for seeing exactly how two adjacent 1s combine into one simplified term.
Instant verification
Check homework or textbook examples in seconds instead of working through the algebra by hand.
All input modes supported
Enter minterms, a truth table, or a Boolean expression — not just clicking cells.
Frequently asked questions
What's the maximum group size in a 2-variable K-map?
A 2-variable map has 4 cells total (2 squared), so the largest possible grouping is the entire map, which reduces the function to a constant 1.
Can a 2-variable map have wraparound groups?
Yes — with only two positions on each axis, the two columns (or rows) are already adjacent to each other by wraparound as well as directly.
Is 2-variable logic useful beyond schoolwork?
Yes — simple multiplexer select logic and basic comparator circuits are real examples of 2-variable functions.