卡诺图化简的算法，保证正确，自己的课程设计，算法精妙-Karnaugh map of simple algorithms, ensuring correct, their curriculum design, algorithm carefully

该程序可以化简卡诺图。首先输入真值，然后该程序会将化简以后的最简形式输出-Simplification of the procedure can be Karnaugh map. First of all input true value, then the program will simplify the simplest form of the future output

KARNAUGH_INPUTS Boolean inputs for a Karnaugh map. K = KARNAUGH_INPUTS(N) produces a table (array) of boolean inputs for a Karnaugh map.Each boolean input has N bits, and there are 2^N entries in the table.

karnaugh diagram implemented