Karnaugh & Algebraic Minimizer is an innovative and versatile application for simplifying Karnaugh maps and Boolean expressions. It is geared for those involved in engineering fields, more precisely electrical engineering students, academics, digital devices constructors or anybody involved with Boolean expressions. With its powerful minimization capabilities and full-fledged features, this tool gives you the flexibility to work with all forms of Boolean expressions and provides quality solutions.


Features:
- Minimize Karnaugh Maps up to 8 variables
- Step-by-step simplification of Boolean expressions up to 26 (A-Z) variables using Boolean algebra laws and theorems
- Step-by-step simplification of Boolean functions up to 8 variables by the Quine–McCluskey algorithm, showing the prime implicant chart and using Petrick's method where appropriate
- View minimized solutions on Karnaugh Map in Sum-of-Product (SOP/CNF) and Product-of-Sum (POS/DNF) forms
- Support Don't Cares
- Fill Karnaugh map using truth table, sets of terms and Boolean expressions
- View all solutions when Karnaugh Maps of less than 6 variables have multiple solutions
- Highlight minimized term on Karnaugh Map
- Optimization of minimized solutions with XOR gates
- Generate circuit from minimized solution with AND/OR/NAND/NOR logic gates
- Generate random Karnaugh maps, truth tables and Boolean expressions
- Custom keyboard for easy input of Boolean expressions
- Support all Boolean operators and constants
- Fully customizable Karnaugh map orientation, variable names, operator symbols and expression format
- Import/Export Karnaugh maps as CSV files
- Beautiful Dark Mode