The Kmap Solver is a tool that solves boolean algebra equations.
This Kmap Solver was created by Dominick Lamastra [TCNJ 2023]. The Quine McCluskey algorithm was used to find the minimal sum of products. This tool was created to support the CSC 325 Computer Architecture course at The College of New Jersey and can be used by others to learn more about Karnaugh Maps.
Version History: Beta Version 9: February 5, 2021 Complete Version 1.0: August 5, 2021
This project can be used as free open source software.
References: Youtube. (2015). Quine-McCluskey Method with Don't Care [Video]. Retrieved 20 December 2020, from https://www.youtube.com/watch?v=B08vV3tIdag. Agrawal, D. (2021). Print all possible combinations of r elements in a given array of size n - GeeksforGeeks. GeeksforGeeks. Retrieved 27 January 2021, from https://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/.
Acknowledgements: Thanks are extended to the following evaluators, who provided valuable feedback during development: Raymond Chow, Sterly Deracy, Matt Hannum, Max Landry, Casey Lishko, and Anthony Messana. Faculty Mentor: Deborah Knox, Ph.D.