What this site does
K-Map Solver minimizes Boolean functions from 2 to 6 variables — via K-map clicks, a truth table, a Boolean expression, or a minterm/maxterm list — and returns the exact minimal SOP or POS form, using essential prime implicant extraction plus Petrick's method rather than a greedy approximation. Alongside the minimized expression, it shows the full prime implicant breakdown (essential, chosen, and redundant), any alternate equally-minimal solutions when a function's structure allows more than one, an auto-generated logic circuit, and a NAND/NOR-only conversion.
Why it was built this way
A lot of free K-map tools online stop at essential prime implicants and call it done — which happens to work for many textbook problems, but silently produces a non-minimal answer on the specific cases where a function's prime implicant chart is cyclic (no essential groups at all). This solver runs Petrick's method on whatever's left after essential extraction every time, specifically so that case still resolves to a genuine minimum instead of a plausible-looking approximation. Every worked example in the blog and the worked examples section was checked against this same engine before being published, not written from memory.
What it costs
Nothing. No sign-up, no account, no paywall. The entire minimization engine runs in your browser — nothing you enter is sent to a server to be solved.
Who's behind it
K-Map Solver is maintained by a small, independent team focused specifically on this tool and the accompanying educational content. If something looks wrong — a bug, an inaccurate claim, a broken page — let us know.