This is the Python 3 implementation of Quine McCluskey algorithm to minimize logical expressions.
This Python script takes minterms and don't care terms(if any) as input and then produces the reduced expression as output.
It displays the whole process of calculating the result.
It displays the minterm groups, Prime Implicant chart and Essential prime implicants while calculating the output.
It uses Petrick's Method to calculate minimized expression from prime implicants chart.
Quine McCluskey Method: https://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm
Petrick's Method: https://en.wikipedia.org/wiki/Petrick%27s_method
Live Demo of Quine McCluskey Python script: https://repl.it/@SumanAdhikari/Quine-McCluskey-Algorithm
I created this script just for fun. So, there might be some errors. Feel free to report them to me.
Here is the scrrenshot of an example:
Hope you enjoy it :)
Note:
A Spanish version of the program is also available now which is initially translated by @fernando170 (https://github.com/int-main/Quine-McCluskey/commits?author=fernando170):
https://github.com/int-main/Quine-McCluskey/tree/master/SpanishVersion
