Releases: RezaGooner/Todo-list
V1
🚀 Karnaugh Map Solver - Official Release
This is the official release of the Karnaugh Map Solver, a Python-based tool designed to simplify Boolean expressions using Karnaugh maps. It efficiently minimizes logic functions, making it useful for students, engineers, and digital logic designers.
🔥 What's New in This Release?
✅ Supports 2, 3, and 4-variable Karnaugh maps
✅ Automatic Boolean expression simplification
✅ Graphical representation of grouped minterms
✅ User-friendly command-line interface
✅ Performance optimizations and bug fixes
📥 How to Download & Use
1️⃣ Download the Release Files
Get the latest release from the Releases section:
👉 Latest Release
Includes:
- Python Source Code: Full implementation of the Karnaugh Map solver.
- Example Cases: Sample inputs and expected outputs.
- Documentation: Instructions on how to use the solver.
🛠️ Installation & Execution
🔹 Run with Python (No Installation Required)
- Ensure Python 3.x is installed on your system.
- Download the release files from GitHub.
- Open a terminal or command prompt and navigate to the project directory:
cd path/to/Karnaugh-Map
Run the script with Python:
python karnaugh_map.py
Follow the on-screen instructions to input your Boolean function.
📌 Features
✅ Simplifies Boolean expressions using K-Maps
✅ Supports SOP (Sum of Products) and POS (Product of Sums) simplifications
✅ Interactive command-line interface for ease of use
✅ Lightweight and fast performance
✅ Useful for digital logic design and optimization
🔧 How to Contribute?
Want to enhance this project? Fork the repository, create a branch, make changes, and submit a pull request.