Algorithm 3.1 -- Generating and Selecting Prime Implicants
1. Count the number of adjacencies for each minterm on the K-map.
2. Select an uncovered minterm with the fewest number of adjacencies. Make an arbitrary choice if more than one choice is possible.
3. Generate a prime implicant for this minterm and put it in the cover. If this minterm is covered by more than one prime implicant, select the one that covers the most uncovered minterms.
4. Repeat steps 2 and 3 until all minterms have been covered.