Skip to main content
Z

Karnaugh Map Solver — Minimise Boolean Expressions

Minimise 2–4 variable Boolean functions to simplest SOP with don’t-care support. Shows prime implicants.

Free No signup Client-side Privacy friendly Updated
Variables:
F
Minimised SOP
F =
Minterms:
Don’t-cares:

Click a cell in the F column to cycle 0 → 1 → X (don’t-care).

How to use

  1. 1 Choose how many variables your function has (2, 3 or 4).
  2. 2 Click each row’s F cell to set its output to 1, X (don’t-care) or 0.
  3. 3 The minimised sum-of-products expression updates instantly.

Why use this tool

  • Minimises Boolean functions using the Quine–McCluskey method.
  • Supports don’t-care conditions for tighter expressions.
  • Shows the prime implicants behind the answer — runs in your browser.

Frequently asked questions

What does this solver produce?

A minimised sum-of-products (SOP) Boolean expression — the fewest terms and literals that reproduce your truth table.

How does it minimise?

It runs the Quine–McCluskey algorithm to find all prime implicants, then selects a minimal cover of the required minterms.

What is a don’t-care (X)?

An input combination whose output you don’t care about. The solver may treat it as 0 or 1 — whichever yields a simpler expression.

What does the prime symbol mean?

A prime (e.g. A′) denotes the complement — the variable is 0 in that term. A bare letter means the variable is 1.

What is Karnaugh Map Solver?

A Karnaugh map solver minimises a Boolean function from its truth table, producing the simplest sum-of-products expression using the Quine–McCluskey method.

Features

Up to 4 variables

Interactive K-map with 1 / 0 / don't-care (X) cells for 2–4 variables.

Quine–McCluskey minimization

Returns the minimal sum-of-products expression, exploiting don't-cares.

Free & private

Runs on your device — nothing is uploaded.

Example

Input

F(A,B): minterms {1, 3} = 1

Output

F = B

Common use cases

  1. 1

    Simplify logic circuits

    Reduce a Boolean function to fewer gates before building it.

  2. 2

    Digital design study

    Learn K-map grouping and SOP minimization.

  3. 3

    Use don't-cares

    Exploit unspecified outputs to simplify the expression further.

Summary

Zerethon's Karnaugh map solver minimizes Boolean functions of up to four variables in your browser. Toggle each cell to 1, 0, or don't-care, and it returns the minimal sum-of-products expression using the Quine–McCluskey algorithm. Everything runs client-side — nothing is uploaded.

Category
Math
Pricing
Free
Privacy
Browser-based
Signup
Not required

References

Privacy

Your data never leaves your browser unless explicitly stated. Karnaugh Map Solver runs entirely client-side — no server upload, no logging, no tracking of your input.

Related tools

Percentage Calculator

Three-in-one percentage calculator: X% of Y, X as a % of Y, and % increase/decrease. Instant, client-side.

Open tool

Scientific Calculator

Online scientific calculator — trig, log, powers, roots, factorial, π/e, DEG/RAD, with a proper expression parser. Client-side.

Open tool

Fraction Calculator

Add, subtract, multiply and divide fractions with automatic simplification, decimal and mixed-number output. Client-side.

Open tool

Combinations & Permutations Calculator

Exact nCr, nPr and n! with big-integer precision. Client-side, no signup.

Open tool

Build, share, and grow on Zerethon Social

Free signup. Earn points, collect achievements, and connect with creators worldwide.

Try Zerethon free