Quine McCluskey Calculator

The tool implements the Quine–McCluskey minimization algorithm to produce the smallest possible sum-of-products expression from a given set of minterms and optional don't-care terms. It is designed for digital logic designers, hardware engineers, and students who need a provably minimal form for HDL implementation or schematic optimization.
Conceptually, the process enumerates implicants, groups by the number of ones, eliminates redundant terms, and derives the prime implicants; then it selects a minimal cover, potentially using Petrick’s method when multiple covers exist.
Output includes the minimal SOP, the list of essential prime implicants, and optional alternative minimal forms. This tool supports typical teaching and design workflows, including HDL translation, gate budgeting, and verification of logic reductions.
Use cases include classroom demonstrations of boolean simplification and practical optimization of digital circuits.