Boolean minimization using Karnaugh maps. Works for any number of bits >3.
-
Updated
Feb 20, 2024 - Python
Boolean minimization using Karnaugh maps. Works for any number of bits >3.
Karnaugh map solver
Karnaugh simplify and other electronic related stuffs with GUI for ease of use
Karnaugh Map Minimization 4 variables
Karnaugh-map for 2 , 3 and 4 variables in both sum of product and product of sum expressions, which takes min-terms or max-terms as input and return simplified expression with desired variables.
This is a python code which solves the karnaugh map of 2 to 4 variables for you. It uses quine mccluskey algorithm to do so.
Add a description, image, and links to the karnaugh-map-solver topic page so that developers can more easily learn about it.
To associate your repository with the karnaugh-map-solver topic, visit your repo's landing page and select "manage topics."