Quine–McCluskey algorithm

The function that is minimized can be entered via a truth table that represents the function y = f(x_n,...,x₁, x₀). You can manually edit this function by clicking on the gray elements in the y column. Alternatively, you can generate a random function by pressing the "Random example" button.

Random example
Number of input variables: 1 2 3 4 5 6 7 8      Allow Don’t-Care: no Yes

Legend:
Don't-care: ×
Implicant (non prime): →
Prime implicant: ✓
Essential prime implicant: ●
Prime implicant but covers only don't-care: (×)

The JavaScript source code can be found here: qmc.js.

This website is part of the lecture Technical Computer Science.

Keywords: interactive Quine–McCluskey algorithm, method of prime implicants, Quine–McCluskey method, Petrick's method for cyclic covering problems, prime implicant chart, html5, javascript