Skip to content
K-Map Solver

Karnaugh Map Solver — POS Form

Product of sums is the dual of sum of products. Describe your function once and read the answer as a product of OR terms.

Try an example
Variables

Range 0–7. Use ranges like 4-7. Every number not listed is 1.

F = Σm(0, 2, 4, 5, 6)

5 ones · 0 don't-cares · 3 zeros

Variable namesA B C

1–3 characters, starting with a letter. Names must be different from each other.

Simplified K-map result

Updates as you edit. Hover a term or a card to see its group on the map.

ABC0001111001

Simplified Boolean expression

F =(A+C')(B'+C')

2 terms4 literals5 gates Checked against your function

Groups

  • (A+C')Essential
    Maxterms
    (1, 3)
    Original
    (A+B+C')(A+B'+C')
    Simplified
    (A+C')
  • (B'+C')Essential
    Maxterms
    (3, 7)
    Original
    (A+B'+C')(A'+B'+C')
    Simplified
    (B'+C')

Truth table check

8 match0 mismatch

Every input row is evaluated against the simplified expression. A don't-care (X) row may give 0 or 1.

mABCYour FResultStatus
000011 Match
100100 Match
201011 Match
301100 Match
410011 Match
510111 Match
611011 Match
711100 Match
Step-by-step: how the solver gets there (Quine–McCluskey)

Logic circuit

Fit
ABCF
1 AND gate, 2 OR gates and 2 inverters8 gate inputs3 levels Simulated circuit matches your function

Hover a gate to highlight its group · drag to pan · Ctrl/⌘ + scroll or the buttons to zoom.

Gate list
  • B' = NOT(B)
  • C' = NOT(C)
  • G1 = OR(A, C')
  • G2 = OR(B', C')
  • F = AND(G1, G2)

Export & share

Files always use the light theme so they print cleanly.

Images
Expression as
F = (A + \overline{C}) (\overline{B} + \overline{C})

What does POS mean on a K-map?

Instead of grouping the ones, you group the zeros. Each group of zeros becomes a sum term in which a variable appears complemented if it is 1 in the group and plain if it is 0. The function is the AND of those sums.

SOP or POS?

Both are correct for the same function. POS can need fewer gates when a function has few zeros, and it maps naturally onto OR–AND or NOR-only circuits. Switch between the forms at any time; the colours and group cards follow.

Worked example: product of sums

A function that is 0 for the input combinations 1, 3 and 7.

F = ΠM(1, 3, 7)

ABC0001111001

Simplified result

F = (A+C')(B'+C')

  • (A+C') — maxterms (1, 3)
  • (B'+C') — maxterms (3, 7)

How to use the K-map solver

  1. Pick the number of variablesChoose 2 to 6. Five and six variables are drawn as several 4×4 layers whose matching cells are neighbours.
  2. Describe your functionClick cells on the map, fill in a truth table, type a Boolean expression, or list minterms or maxterms. All five views edit the same function.
  3. Mark don't-caresCycle a cell 0 → 1 → X. A don't-care may be treated as 0 or 1, whichever makes the groups bigger.
  4. Choose SOP or POSSum of products groups the ones. Product of sums groups the zeros and gives the maxterm form.
  5. Read the groupsEach coloured outline is one term. The same colour marks the term in the expression and its card, which lists the cells it covers.
  6. Check, build, exportCompare the result with your input in the verification table, open the logic circuit, step through the algorithm, then export or share.

Key features

  • 2 to 6 variables

    Up to 64 cells, with layered maps for 5 and 6 variables.

  • Five ways to enter a function

    Map, truth table, expression, minterm list or maxterm list — switch freely.

  • Provably minimal

    Exact cover search over all prime implicants, with every equally good alternative on offer.

  • Don't-care aware

    X cells enlarge groups but never have to be covered.

  • Wrap-around groups

    Groups across the map edges are drawn as open brackets, the way textbooks show them.

  • Logic circuit

    AND–OR, OR–AND, NAND-only or NOR-only schematics with zoom and gate counts.

  • Self-checking

    Every answer is re-evaluated against your input; a truth table flags any mismatch.

  • Step-by-step

    Quine–McCluskey tables, the prime-implicant chart and Petrick's method.

  • Export and share

    PDF report, PNG/SVG, LaTeX, Verilog, VHDL, C, and a link that reopens your problem.

  • Private and offline-friendly

    Everything runs in your browser. Nothing you enter is uploaded.

Frequently asked questions

How do I get POS?

Pick “POS” in the result header. The input can be any of the five methods.

What are maxterms?

A maxterm is a sum that is 0 for exactly one input combination. Listing the maxterms of a function means listing the inputs where it is 0.

Are don't-cares handled in POS?

Yes: a don't-care may join a group of zeros to make it bigger, but it never has to be covered.