QuineMcCluskeySolver

Insert each value on a new line
Demo 1 ~ Demo 2

Input

0
1	m2 0010 d1 0001
2	m3 0011 m9 1001 d10 1010
3	m7 0111 m11 1011 m13 1101
4	d15 1111

First Comparasion

0
1	( 3 , 2 ) 001- ( 10 , 2 ) -010 ( 3 , 1 ) 00-1 ( 9 , 1 ) -001
2	( 7 , 3 ) 0-11 ( 11 , 3 ) -011 ( 11 , 9 ) 10-1 ( 13 , 9 ) 1-01 ( 11 , 10 ) 101-
3	( 15 , 7 ) -111 ( 15 , 11 ) 1-11 ( 15 , 13 ) 11-1

Second Comparasion

0
1	( 11 , 10 , 3 , 2 ) -01- ( 11 , 9 , 3 , 1 ) -0-1
2	( 15 , 11 , 7 , 3 ) --11 ( 15 , 13 , 11 , 9 ) 1--1

Prime Implicants

( 11 , 10 , 3 , 2 ) -01-
( 11 , 9 , 3 , 1 ) -0-1
( 15 , 11 , 7 , 3 ) --11
( 15 , 13 , 11 , 9 ) 1--1

Coverage Table

	-01-	-0-1	--11	1--1
2	X
3	X	X	X
7			X
9		X		X
11	X	X	X	X
13				X

Essential Prime Implicants

Using column/row dominance methods.
Tutorial

AD + CD + B'C

This project was created under supervision of Prof. Mohamed Shalaan
by Hatem Hassan as part of the Digital Design course
at The American University in Cairo.
http://quinemccluskey.com/