This is an implementation of Quine_McCluskey algorithm in Python. It shows all the step of finding the prime implicants. Then chooses those who are essential and prints out the function.
So consider a boolean function with following Karnaugh map (the stars are don't-care terms) :
Which means the min-terms are:
0, 4, 8, 12, 3, 10 and the don't care terms are 2, 11.
You can pass the into the program :
Then it will clear the terminal and print out the result:
