Page2

content:
pageno:

1 Real-lifeapplicationsKarnaughMaps(K-maps):---------------------------------------------- 3

2 flowchart 4

3 Implementationofkmap 5

4 code 7

5 output 18

6 crosscheckforaccuracy 20

7 reference 22
 Page3

Real-lifeapplicationsKarnaughMaps(K-maps):

KarnaughMaps(K-maps)areavaluabletoolindigitallogicdesignandhaveseveralsignificantreal-life
applications:

1) Digital Circuits:

 Karnaugh maps are widely used in the design of digital circuits. The simplified
expressions obtained from K-Maps can be easily translated into logic gates, making it
easier to design and implement the circuit.

2) Computer memory:

 K-Maps are used in the design of computer memory. The simplified expressions
obtained from K-Maps help in reducing the size and complexity of the memory circuit.

3) Communication systems:

 K-Maps are used in the design of communication systems. The simplified expressions
obtained from K-Maps help in reducing the complexity and improving the efficiency of
the communication system.

4) Consumer electronics:

 K-Maps are used in the design of consumer electronics such as televisions, radios, and
other electronic devices. The simplified expressions obtained from K-Maps help in
reducing the size and complexity of electronic devices.

5) Automotive electronics:

 K-Maps are used in the design of automotive electronics such as engine control units,
braking systems, and other electronic systems. The simplified expressions obtained
from K-Maps help in reducing the size and complexity of the electronic systems, making
them more efficient and reliable.
 Page4

Flowchart
 Page5

Implementationstepsusedindesigningofthealgorithm
1) Define Functions:
a. inp2_k_map(mt, mip):
 Takes a list of minterms (mt) and an indicator mip for whether it's for SOP (Sum of Products)
or POS (Product of Sums).
 Processes the inputs to create a 2x2 K-Map and performs simplification based on minterms.
 Prints the simplified equation.

b. inp3_k_map(mt, mip):
 Takes a list of minterms (mt) and an indicator mip for whether it's for SOP (Sum of Products)
or POS (Product of Sums).
 Processes the inputs to create a 2x4 K-Map and performs simplification based on minterms.
 Prints the simplified equation

c. inp4_k_map(mt, mip):
 Takes a list of minterms (mt) and an indicator mip for whether it's for SOP (Sum of Products)
or POS (Product of Sums).
 Processes the inputs to create a 4x4 K-Map and performs simplification based on minterms.
 Prints the simplified equation

2) User Interaction Loop:

 The script contains a loop that allows the user to perform K-Map simplifications multiple
times.

3) User Input:
 The user is prompted to input the number of variables (nfinp) and whether it's for SOP or POS
(mimastr).

4) Input Validation:
 The input for the number of variables is checked to be either 2, 3, or 4. The input for SOP/POS
is checked to be either 'S' or 'P'.

5) Minterm/Maxterm Input:
 The user is prompted to input a list of minterms (for SOP) or maxterms (for POS).

6) K-Map Generation:
 Based on the number of variables, the corresponding K-Map function is called.

7) K-Map Processing:
 The K-Map is populated based on the input minterms/maxterms.

8) K-Map Display:
 The K-Map is displayed.

9) Simplification:
 The script performs the necessary logic operations and simplifications based on patterns in
the K-Map.
 Page6
10) Output Display:
 The simplified boolean expression is displayed.

11) User Option:

 The user is asked whether they want to perform another simplification or exit the program.

12) Repeat or Exit:

 Depending on the user's choice, the loop continues or the program terminates.
 Page7
Code in python : (Sourcehttps://github.com/vijaybharath99/Karnaugh-
Map/blob/master/K_map_complete_2_3_4_var.py)

#Code

def inp2_k_map(mt,nip):
for i in range(50):print("-",end='')
print()
prnt=input("Enter Variables with single space(eg:A B) : ").split(" ")
for i in range(len(mt)):
mt[i]='0b'+bin(mt[i])[2:].lstrip('0')
op=''
ans=[[0,0],[0,0]]
ansmx=[[0,0],[0,0]]
flag=0
temp=[]
for i in range(2):
for j in range(2):
p='0b'+(bin(i)[2:]+bin(j)[2:]).lstrip('0')
if p in mt:
ans[i][j]=1
for i in range(50):print("-",end='')
print()
print("The kmap plotted : ")
if nip==1:
for each in ans:print(*each)
elif nip==2:
for i in range(2):
for j in range(2):

if ans[i][j]==1:
ansmx[i][j]=0
else:
ansmx[i][j]=1
for each in ansmx:print(*each)
if ans==[[1,1],[1,1]]:
flag=1
op='1'

if flag==0:
for i in range(2):
if ans[i]==[1,1]:
if nip==1:
op='A ' if i==1 else "A' "
elif nip==2:
op="(A') " if i==1 else "(A) "
temp.extend([(i,0),(i,1)])

if flag==0:
if ans[0][0]==1 and ans[1][0]==1:
 Page8
if nip==1:
op=op+"B' "
elif nip==2:
op=op+"(B) "
temp.extend([(0,0),(1,0)])
elif ans[0][1]==1 and ans[1][1]==1:
if nip==1:
op=op+"B "
elif nip==2:
op=op+"(B') "
temp.extend([(0,1),(1,1)])
if nip==1:
vr=["A'B' ","A'B ","AB' ","AB "]
elif nip==2:
vr=["(A+B) ","(A+B') ","(A'+B) ","(A'+B') "]

if flag==0:
for i in range(2):
for j in range(2):
if ans[i][j]==1 and (i,j) not in temp:
op=op+vr[int('0b'+bin(i)[2:]+bin(j)[2:],2)]
op=op.rstrip(" ")
if nip==1:
op=op.replace(" ","+")
op=op.replace("A",prnt[0])
op=op.replace("B",prnt[1])
for i in range(50):print("*",end='')
print()
print("The simplified equation is :",op)
for i in range(50):print("*",end='')
print()

#K_Map for 4 inputs.

def inp4_k_map(mt,nip):
import copy
for _ in range(50):print("-",end='')
print()
pr_v=input("Enter variables single space(eg:A B C D) : ").split(" ")
an=[]
anmx=[]
(tmp,flag)=(0,0)
op=''

for i in range(4):
an.append([0]*4)
anmx.append([0]*4)

for i in range(4):
for j in range(4):
if i<2:
bi='0'+bin(i)[2:]
else:
bi=bin(i)[2:]
if j<2:
bj='0'+bin(j)[2:]
else:
bj=bin(j)[2:]
p=int('0b'+bi+bj,2)
if p in mt:
an[i][j]=1
for i in range(4):
(an[i][2],an[i][3])=(an[i][3],an[i][2])
 Page9
for i in range(4):
(an[2][i],an[3][i])=(an[3][i],an[2][i])

for _ in range(50):print("-",end='')
print()
print("The K-Map plotted : ")
if nip==1:
for each in an:
print(*each)
elif nip==2:
for i in range(4):
for j in range(4):
if an[i][j]==1:
anmx[i][j]=0
else:
anmx[i][j]=1
for each in anmx:print(*each)

octa=[]
qrd=[]
qrd_ref=[]
qrd_rep=[]
dul=[]
sngl=[]
if nip==1:
octa_val=[["C' ","D ","C ","D' "],["A' ","B ","A ","B' "]] # 0 for vert and 1 for horz
qrd_val=[["C'D' ","C'D ","CD ","CD' "],["A'B' ","A'B ","AB ","AB' "]] # 0 for vert and 1 for horz
qrd_val_4=[["A'C' ","A'D ","A'C ","A'D' "],["BC' ","BD ","BC ","BD' "],["AC' ","AD ","AC ","AD' "],["B'C'
","B'D ","B'C ","B'D' "]]
dul_vert=[["A'C'D' ","A'C'D ","A'CD ","A'CD' "],["BC'D' ","BC'D ","BCD ","BCD' "],["AC'D' ","AC'D ","ACD
","ACD' "],["B'C'D' ","B'C'D ","B'CD ","B'CD' "]]
dul_horz=[["A'B'C' ","A'B'D ","A'B'C ","A'B'D' "],["A'BC' ","A'BD ","A'BC ","A'BD' "],["ABC' ","ABD ","ABC
","ABD' "],["AB'C' ","AB'D ","AB'C ","AB'D' "]]
sngl_val=[["A'B'C'D' ","A'B'C'D ","A'B'CD ","A'B'CD' "],["A'BC'D' ","A'BC'D ","A'BCD ","A'BCD'
"],["ABC'D' ","ABC'D ","ABCD ","ABCD' "],["AB'C'D' ","AB'C'D ","AB'CD ","AB'CD' "]]
elif nip==2:
octa_val=[["(C) ","(D') ","(C') ","(D) "],["(A) ","(B') ","(A') ","(B) "]] # 0 for vert and 1 for horz
qrd_val=[["(C+D) ","(C+D') ","(C'+D') ","(C'+D) "],["(A+B) ","(A+B') ","(A'+B') ","(A'+B) "]] # 0 for vert
and 1 for horz
qrd_val_4=[["(A+C) ","(A+D') ","(A+C') ","(A+D) "],["(B'+C) ","(B'+D') ","(B'+C') ","(B'+D) "],["(A'+C)
","(A'+D') ","(A'+C') ","(A'+D) "],["(B+C) ","(B+D') ","(B+C') ","(B+D) "]]
dul_vert=[["(A+C+D) ","(A+C+D') ","(A+C'+D') ","(A+C'+D) "],["(B'+C+D) ","(B'+C+D') ","(B'+C'+D')
","(B'+C'+D) "],["(A'+C+D) ","(A'+C+D') ","(A'+C'+D') ","(A'+C'+D) "],["(B+C+D) ","(B+C+D') ","(B+C'+D')

","(B+C'+D) "]]
dul_horz=[["(A+B+C) ","(A+B+D') ","(A+B+C') ","(A+B+D) "],["(A+B'+C) ","(A+B'+D') ","(A+B'+C')
","(A+B'+D) "],["(A'+B'+C) ","(A'+B'+D') ","(A'+B'+C') ","(A'+B'+D) "],["(A'+B+C) ","(A'+B+D') ","(A'+B+C')
","(A'+B+D) "]]
sngl_val=[["(A+B+C+D) ","(A+B+C+D') ","(A+B+C'+D') ","(A+B+C'+D) "],["(A+B'+C+D) ","(A+B'+C+D')
","(A+B'+C'+D') ","(A+B'+C'+D) "],["(A'+B'+C+D) ","(A'+B'+C+D') ","(A'+B'+C'+D') ","(A'+B'+C'+D)
"],["(A'+B+C+D) ","(A'+B+C+D') ","(A'+B+C'+D') ","(A'+B+C'+D) "]]

if an==[[1]*4,[1]*4,[1]*4,[1]*4]:
op='1'
else:
for i in range(-1,3):
if an[i][0]==1 and an[i][1]==1 and an[i][2]==1 and an[i][-1]==1 and an[i+1][0]==1 and an[i+1][1]==1
and an[i+1][2]==1 and an[i+1][-1]==1:
op=op+octa_val[1][i]
octa.append([(i,0),(i,1),(i,2),(i,-1)])
if i<2:
octa.append([(i+1,0),(i+1,1),(i+1,2),(i+1,-1)])
 Page10
else:
octa.append([(-1,0),(-1,1),(-1,2),(-1,-1)])
if i<2:
octa.append([(i,0),(i+1,0),(i,1),(i+1,1)])
octa.append([(i,1),(i+1,1),(i,2),(i+1,2)])
octa.append([(i,2),(i+1,2),(i,-1),(i+1,-1)])
octa.append([(i,-1),(i+1,-1),(i,0),(i+1,0)])
else:
octa.append([(i,0),(-1,0),(i,1),(-1,1)])
octa.append([(i,1),(-1,1),(i,2),(-1,2)])
octa.append([(i,2),(-1,2),(i,-1),(-1,-1)])
octa.append([(i,-1),(-1,-1),(i,0),(-1,0)])

for i in range(-1,3):
if an[0][i]==1 and an[1][i]==1 and an[2][i]==1 and an[-1][i]==1 and an[0][i+1]==1 and an[1][i+1]==1
and an[2][i+1]==1 and an[-1][i+1]==1:
op=op+octa_val[0][i]
octa.append([(0,i),(1,i),(2,i),(-1,i)])
if i<2:
octa.append([(0,i+1),(1,i+1),(2,i+1),(-1,i+1)])
else:
octa.append([(0,-1),(1,-1),(2,-1),(-1,-1)])
if i<2:
octa.append([(0,i),(1,i),(0,i+1),(1,i+1)])
octa.append([(1,i),(2,i),(1,i+1),(2,i+1)])
octa.append([(2,i),(-1,i),(2,i+1),(-1,i+1)])
octa.append([(-1,i),(0,i),(-1,i+1),(0,i+1)])
else:
octa.append([(0,i),(1,i),(0,-1),(1,-1)])
octa.append([(1,i),(2,i),(1,-1),(2,-1)])
octa.append([(2,i),(-1,i),(2,-1),(-1,-1)])
octa.append([(-1,i),(0,i),(-1,-1),(0,-1)])

for i in range(-1,3):
if an[i][0]==1 and an[i][1]==1 and an[i][2]==1 and an[i][-1]==1:
qrd_ref.append([(i,0),(i,1),(i,2),(i,-1)])
if an[0][i]==1 and an[1][i]==1 and an[2][i]==1 and an[-1][i]==1:
qrd_ref.append([(0,i),(1,i),(2,i),(-1,i)])

for i in range(-1,3):
for j in range(-1,3):
if an[i][j]==1 and an[i][j+1]==1 and an[i+1][j]==1 and an[i+1][j+1]==1:
if i==2 and j==2:
temp=[(i,j),(-1,j),(i,-1),(-1,-1)]

elif i==2 and j<2:

temp=[(i,j),(-1,j),(i,j+1),(-1,j+1)]
elif j==2 and i<2:
temp=[(i,j),(i+1,j),(i,-1),(i+1,-1)]
else:
temp=[(i,j),(i+1,j),(i,j+1),(i+1,j+1)]
qrd_ref.append(temp)

for i in range(-1,3):
if an[i][0]==1 and an[i][1]==1 and an[i][2]==1 and an[i][-1]==1:
if [(i,0),(i,1),(i,2),(i,-1)] not in octa:
op=op+qrd_val[1][i]
qrd.append([(i,0),(i,1)])
qrd.append([(i,1),(i,2)])
qrd.append([(i,2),(i,-1)])
qrd.append([(i,-1),(i,0)])
 Page11
for i in range(-1,3):
if an[0][i]==1 and an[1][i]==1 and an[2][i]==1 and an[-1][i]==1:
if [(0,i),(1,i),(2,i),(-1,i)] not in octa:
op=op+qrd_val[0][i]
qrd.append([(0,i),(1,i)])
qrd.append([(1,i),(2,i)])
qrd.append([(2,i),(-1,i)])
qrd.append([(-1,i),(0,i)])

for i in range(-1,3):
for j in range(-1,3):
if an[i][j]==1 and an[i][j+1]==1 and an[i+1][j]==1 and an[i+1][j+1]==1:
if i==2 and j==2:
temp=[(i,j),(-1,j),(i,-1),(-1,-1)]
elif i==2 and j<2:
temp=[(i,j),(-1,j),(i,j+1),(-1,j+1)]
elif j==2 and i<2:
temp=[(i,j),(i+1,j),(i,-1),(i+1,-1)]
else:
temp=[(i,j),(i+1,j),(i,j+1),(i+1,j+1)]
if temp not in octa:
op=op+qrd_val_4[i][j]
if i<2 and j<2:
qrd.append([(i,j),(i,j+1)])
qrd.append([(i+1,j),(i+1,j+1)])
qrd.append([(i,j),(i+1,j)])
qrd.append([(i,j+1),(i+1,j+1)])
if j==2 and i<2:
qrd.append([(i,j),(i,-1)])
qrd.append([(i+1,j),(i+1,-1)])
qrd.append([(i,j),(i+1,j)])
qrd.append([(i,-1),(i+1,-1)])
if j<2 and i==2:
qrd.append([(i,j),(i,j+1)])
qrd.append([(-1,j),(-1,j+1)])
qrd.append([(i,j),(-1,j)])
qrd.append([(i,j+1),(-1,j+1)])
if i==2 and j==2:
qrd.append([(i,j),(i,-1)])
qrd.append([(-1,j),(-1,-1)])
qrd.append([(i,j),(-1,j)])
qrd.append([(i,-1),(-1,-1)])

for i in range(-1,3):

for j in range(-1,3):
if an[i][j]==1 and an[i][j+1]==1:
if j==2:
temp=[(i,j),(i,-1)]
else:
temp=[(i,j),(i,j+1)]
if temp not in qrd:
op=op+dul_horz[i][j]
if j==2:
dul.append([(i,j),(i,-1)])
else:
dul.append([(i,j),(i,j+1)])
if an[i][j]==1 and an[i+1][j]==1:
if i==2:
temp=[(i,j),(-1,j)]
else:
temp=[(i,j),(i+1,j)]
 Page12
if temp not in qrd:
op=op+dul_vert[i][j]
if i==2:
dul.append([(i,j),(-1,j)])
else:
dul.append([(i,j),(i+1,j)])

for each in octa:

sngl.extend(each)
for each in qrd:
sngl.extend(each)
for each in dul:
sngl.extend(each)
for i in range(-1,3):
for j in range(-1,3):
if an[i][j]==1:
if (i,j) not in sngl:
op=op+sngl_val[i][j]

op=op.strip()
opl=op.split(" ")
for i in range(len(opl)):
opl[i]=opl[i]+" "

dulref=copy.deepcopy(dul)

for each in dul:

(d1,d2)=(each[0],each[1])
(cntd1,cntd2)=(0,0)
for each in dulref:
if d1 in each:
cntd1+=1
if d2 in each:
cntd2+=1
for each in qrd_ref:
if d1 in each:
cntd1+=1
if d2 in each:
cntd2+=1
if cntd1>1 and cntd2>1:
try:
if d1[0]==d2[0]:
opl.remove(dul_horz[d1[0]][d1[1]])
if d1[1]==d2[1]:
opl.remove(dul_vert[d1[0]][d1[1]])

dulref.remove([(d1[0],d1[1]),(d2[0],d2[1])])
except ValueError:
continue

for each in qrd_ref:

(d1,d2,d3,d4)=(each[0],each[1],each[2],each[3])
(d1cnt,d2cnt,d3cnt,d4cnt)=(0,0,0,0)
for each1 in dul:
if d1 in each1:
d1cnt+=1
if d2 in each1:
d2cnt+=1
if d3 in each1:
d3cnt+=1
if d4 in each1:
d4cnt+=1
 Page13
for each2 in qrd_ref:
if each!=each2:
if d1 in each2:
d1cnt+=1
if d2 in each2:
d2cnt+=1
if d3 in each2:
d3cnt+=1
if d4 in each2:
d4cnt+=1
if d1cnt>0 and d2cnt>0 and d3cnt>0 and d4cnt>0:
try:
if d1[0]!=d2[0] and d1[1]!=d3[1]:
opl.remove(qrd_val_4[d1[0]][d1[1]])
except ValueError:
continue

for each in qrd_ref:

(d1,d2,d3,d4)=(each[0],each[1],each[2],each[3])
(d1cnt,d2cnt,d3cnt,d4cnt)=(0,0,0,0)
for each1 in qrd_ref:
if each1!=each:
if d1 in each1:
d1cnt+=1
if d2 in each1:
d2cnt+=1
if d3 in each1:
d3cnt+=1
if d4 in each1:
d4cnt+=1
if d1cnt>0 and d2cnt>0 and d3cnt>0 and d4cnt>0:
try:
if d1[0]==d2[0]==d3[0]==d4[0]:
opl.remove(qrd_val[1][d1[0]])
elif d1[1]==d2[1]==d3[1]==d4[1]:
opl.remove(qrd_val[0][d1[1]])
except ValueError:
continue

op=''.join(opl)
for _ in range(50):print("*",end='')
print()
op=op.strip(" ")
if nip==1:
op=op.replace(" "," + ")
op=op.replace("A",pr_v[0])

op=op.replace("B",pr_v[1])
op=op.replace("C",pr_v[2])
op=op.replace("D",pr_v[3])
print("Simplified equation is :",op)

for _ in range(50):print("*",end='')
print()

#K_Map for 3 inputs.

def inp3_k_map(mt,nip):
for i in range(50):print("-",end='')
print()
var_re=input("Enter variables with single space(eg:A B C) : ").split(" ")
ansg=[[0,0,0,0],[0,0,0,0]]
 Page14
ansgmx=[[0,0,0,0],[0,0,0,0]]
op=''
flag=0
qrd=[]
dul=[]
sngl=[]
if nip==1:
qrd_var_2_2=["B' ","C ","B ","C' "]
qrd_var_1_4=["A' ","A "]
dul_vert=["B'C' ","B'C ","BC ","BC' "]
dul_horz=[["A'B' ","A'C ","A'B ","A'C' "],["AB' ","AC ","AB ","AC'"]]
sngl_val=[["A'B'C' ","A'B'C ","A'BC ","A'BC' "],["AB'C' ","AB'C ","ABC ","ABC' "]]
elif nip==2:
qrd_var_2_2=["(B) ","(C') ","(B') ","(C) "]
qrd_var_1_4=["(A) ","(A') "]
dul_vert=["(B+C) ","(B+C') ","(B'+C') ","(B'+C) "]
dul_horz=[["(A+B) ","(A+C') ","(A+B') ","(A+C) "],["(A'+B) ","(A'+C') ","(A'+B') ","(A'+C) "]]
sngl_val=[["(A+B+C) ","(A+B+C') ","(A+B'+C') ","(A+B'+C) "],["(A'+B+C) ","(A'+B+C') ","(A'+B'+C')
","(A'+B'+C) "]]
for i in range(2):
for j in range(4):
p=int('0b'+bin(i)[2:]+bin(j)[2:],2)
if (i==1) and (j==0 or j==1):
p=int('0b'+bin(i)[2:]+'0'+bin(j)[2:],2)
if p in mt:
ansg[i][j]=1

for i in range(2):
(ansg[i][2],ansg[i][3])=(ansg[i][3],ansg[i][2])
for i in range(50):print("-",end='')
print()
print("K-Map plotted : ")
if nip==1:
for each in ansg:print(*each)
elif nip==2:
for i in range(2):
for j in range(4):
if ansg[i][j]==1:
ansgmx[i][j]=0
else:
ansgmx[i][j]=1
for each in ansgmx:print(*each)

if ansg==[[1]*4,[1]*4]:
op=op+'1'
flag=1

if flag==0:
for j in range(-1,3):
if ansg[0][j]==1 and ansg[-1][j]==1 and ansg[0][j+1]==1 and ansg[-1][j+1]==1:
qrd.append([(0,j),(-1,j)])
if j<2:
qrd.append([(0,j+1),(-1,j+1)])
qrd.append([(0,j),(0,j+1)])
qrd.append([(-1,j),(-1,j+1)])
else:
qrd.append([(0,-1),(-1,-1)])
qrd.append([(0,j),(0,-1)])
qrd.append([(-1,j),(-1,-1)])
op=op+qrd_var_2_2[j]
if flag==0:
 Page15
for i in range(-1,1):
if ansg[i]==[1,1,1,1]:
qrd.append([(i,-1),(i,0)])
qrd.append([(i,0),(i,1)])
qrd.append([(i,1),(i,2)])
qrd.append([(i,2),(i,-1)])
op=op+qrd_var_1_4[i]
if flag==0:
for j in range(-1,3):
if ansg[0][j]==1 and ansg[1][j]==1:
temp=0
if [(0,j),(-1,j)] in qrd:
temp=1
elif [(-1,j),(0,j)] in qrd:
temp=1
if temp==0:
dul.append([(0,j),(-1,j)])
op=op+dul_vert[j]

if flag==0:
for i in range(-1,1):
for j in range(-1,3):
if ansg[i][j]==1 and ansg[i][j+1]==1:
temp=0
if j==2:
if [(i,j),(i,-1)] in qrd:
temp=1
elif [(i,-1),(i,j)] in qrd:
temp=1
else:
if [(i,j),(i,j+1)] in qrd:
temp=1
elif [(i,j+1),(i,j)] in qrd:
temp=1
if temp==0:
if j==2:
dul.append([(i,2),(i,-1)])
else:
dul.append([(i,j),(i,j+1)])
op=op+dul_horz[i][j]

op=op.rstrip(" ")
opl=op.split(" ")
for i in range(len(opl)):
opl[i]=opl[i]+" "

for each in dul:

d1cnt=0

d2cnt=0
(d1,d2)=(each[0],each[1])
for each1 in dul:
if d1 in each1:
d1cnt+=1
if d2 in each1:
d2cnt+=1
if d1cnt>1 and d2cnt>1:
(d1i,d1j)=d1
(d2i,d2j)=d2
if d1i==d2i:
p=dul_horz[d1i][d1j]
opl.remove(p)
 Page16
else:
p=dul_vert[d1j]
opl.remove(p)
dul.remove([d1,d2])
op="".join(opl)

for _ in qrd:
for each in _:
sngl.append(each)
for _ in dul:
for each in _:
sngl.append(each)

if flag==0:
for i in range(-1,1):
for j in range(-1,3):
if ansg[i][j]==1:
if (i,j) not in sngl:
op=op+sngl_val[i][j]

op=op.rstrip(" ")
if nip==1:
op=op.replace(' ',' + ')

op=op.replace("A",var_re[0])
op=op.replace("B",var_re[1])
op=op.replace("C",var_re[2])
for i in range(50):print("*",end='')
print()
print("The simplified equation is :",op)
for i in range(50):print("*",end='')
print()

#main
ask='N'
while ask=='N':
for _ in range(50):print("-",end='')
print()
nfinp=int(input("Enter no of Inputs(2,3,4) : "))
mimastr=input("Enter 'S' for SOP(Minterms) or 'P' for POS(Maxterms) : ").lower()
if mimastr=='p':
mima=2
elif mimastr=='s':
mima=1
if mima==1:
mt=list(map(int,input("Enter Minterms : ").split()))
else:
mt=list(map(int,input("Enter Maxterms : ").split()))
if nfinp==2:

inp2_k_map(mt,mima)
elif nfinp==3:
inp3_k_map(mt,mima)
elif nfinp==4:
inp4_k_map(mt,mima)
else:
print("You committed some mistake, please check the inputs next time.")
ask=input("Enter 'N' for NEXT K-Map or 'E' to exit : ").lower()
for i in range(25):print("--",end='')
print()
 Page17

Output:
For variable 2:

SOP:

POS:
 Page18

Output:
For variable 3:

SOP:

POS:
 Page19

Output:
For variable 4:

SOP:

POS:
 Page20

knn
Page21
 Page22

:
sop:

pos:

forvariable3: Sop:

pos:
 Page23

Forvariable4:
Sop:

Pos:
 Page24

crosschecktheaccuracy:
FORVARIABLE4:
THEMANUALIMPLEMENTATIONOFTHEKMAP :

THEOUTPUT OFTHECODE:
 Page25

FORVARIABLE3:
THEMANUALIMPLEMENTATIONOFTHEKMAP:

THEOUTPUT OFTHECODE:

Aswecanseefromthechecksabovethecodegaveusthecorrectanswerswith100%accuracy.
 Page26

Reference:

1) https://github.com/AmitGZ/Karnaugh_Solver.git/

2) https://www.geeksforgeeks.org/introduction-of-k-map-karnaugh-map/

3) https://www.allaboutcircuits.com/textbook/digital/chpt-8/logic-simplification-karnaugh-maps/

4) https://byjus.com/gate/introduction-of-k-map-karnaugh-map-notes/