Karnaugh Map Solver, for Boolean Logic in Five Input Modes

Field notes

The solver accepts a Boolean expression such as AB' + C, a list of minterms or maxterms, a truth table, or direct cell edits, then keeps those representations synchronized. It supports two through five variables and cycles cells among 0, 1, and don't-care states. The page also exposes grouping breakdowns, a gate-level circuit view, and a PDF export, while describing step-by-step Quine–McCluskey and Petrick’s method traces.