V1

🚀 Karnaugh Map Solver - Official Release

This is the official release of the Karnaugh Map Solver, a tool designed for simplifying Boolean expressions using Karnaugh maps. It provides an efficient and intuitive way to minimize 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 input and output system
✅ Performance optimizations and bug fixes
📥 How to Download
1️⃣ Download the Release Files

Get the latest release from the Releases section:
👉 Latest Release

Includes:

Source Code: Full implementation of the Karnaugh Map solver.
Executable File: Ready-to-use compiled version.
Documentation: Usage instructions and example cases.

پ
📌 Features

✅ Simplifies Boolean expressions using K-Maps
✅ Highlights grouped minterms for easy visualization
✅ Supports SOP (Sum of Products) and POS (Product of Sums) simplifications
✅ 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.