K-Map Calculator: Simplify Boolean Functions with Karnaugh Maps

Quickly reduce a Boolean expression to its minimal form: choose 2–4 variables, enter minterms (e.g., “1,2”) and optional don't-cares (e.g., “3”), then press Simplify. The tool shows the Karnaugh map and the compact logic equation—useful because K-map minimization trims gate counts by roughly 30 % in medium-scale circuits (Rahman & Hasan, 2022).