About
minterms.com is a place to learn how Boolean functions are minimized — and to check your work.
Why this site
Minimization is one of the first places in a digital logic course where the procedure matters as much as the answer. A tool that prints only the final expression does not help much when your own answer is different. The tools here are built to show every step, so you can find the exact point where your hand solution went another way.
What is here
Today: an interactive minimizer for the Scheinman tree method, for single- and multiple-output functions, with a step-by-step view of the tree and the prime implicant chart — and a step viewer that draws every node of the tree the way you would write it by hand.
Also: eight short lessons, and more tools — a Karnaugh map solver, step-by-step Quine–McCluskey, a truth-table converter, a gate circuit viewer and Espresso. They run in your browser, so nothing you type is sent anywhere.
How it is built
Plain pages, no accounts, no sign-ups. The tools run in your browser, so the functions you type stay on your machine. Lesson and tool pages show Google AdSense ads to help pay for hosting; Google may use cookies for them — see the privacy page for what that means and how to opt out. It should load fast on a phone and work on a projector.
Contact
Found a mistake, or have an example that gives a surprising result? Write to emad@wayne.edu.