Is your feature request related to a problem? Please describe.
Complete our steps to solving QM by using the 3-step heuristics to solve PI table.
Describe the solution you'd like
Apply Petrick's Algorithm and find the minimum solutions
Input: Prime implicant chart, list of prime implicants, and the number of columns.
Create a list of sets called productTerms to store the product terms for each column.
Initialize a set called currentTerm with all the implicants.
Create an empty list called solutions to store the minimum solutions.
While the currentTerm is not empty:
a. Check if the currentTerm covers all columns:
If yes, add it to the solutions list.
b. Find the maximum term size among the implicants in the currentTerm.
c. Create an empty set called nextTerm.
d. Iterate over each implicant in the currentTerm:
If the implicant has the maximum term size:
i. Combine its product term with the product terms of the other implicants in the currentTerm.
ii. Add the resulting term to the nextTerm set.
Is your feature request related to a problem? Please describe. Complete our steps to solving
QMby using the 3-step heuristics to solve PI table. Describe the solution you'd like Apply Petrick's Algorithm and find the minimum solutionsInput: Prime implicant chart, list of prime implicants, and the number of columns.
Create a list of sets called productTerms to store the product terms for each column.
Initialize a set called currentTerm with all the implicants.
Create an empty list called solutions to store the minimum solutions.
While the currentTerm is not empty:
a. Check if the currentTerm covers all columns:
c. Create an empty set called nextTerm.
d. Iterate over each implicant in the currentTerm:
e. Set the nextTerm as the new currentTerm.