Karnaugh K-Map Solver

Karnaugh K-Map Solver makes Boolean algebra and digital logic simplification fast, clear and visual.

Create a Karnaugh map, enter your values and instantly obtain the simplified Boolean expression, optimal cell groups and logic circuit implementation.

SUPPORTED K-MAPS

• 3 variables: 2×4 K-Map

• 4 variables: 4×4 K-Map

• 5 variables: 4×8 K-Map

• Gray code ordering

• Don’t-care conditions

• Edge and wrap-around grouping

BOOLEAN SIMPLIFICATION

• Sum of Products (SOP)

• Product of Sums (POS)

• Minterm simplification

• Maxterm simplification

• Prime implicant grouping

• Minimal Boolean expressions

LOGIC CIRCUITS

• Standard AND, OR and NOT implementation

• NAND-only circuit implementation

• NOR-only circuit implementation

• Clear visual circuit diagrams

Karnaugh K-Map Solver is useful for students, teachers, engineers and anyone learning Boolean algebra, digital electronics, logic gates, truth tables, combinational circuits or computer engineering.

Simplify K-Maps, verify homework and understand digital logic with a clean, fast and intuitive Karnaugh map calculator.