@darkexodus The goal is the minimum number of products, and the minimum number of terms in each term. I can't remember if there is a possibility for non-trivial different solutions, but here it is very clear that you don't have a choice between {!a!b,bc!d}, you must choose the product with the fewest terms (!a!b) to cover the K-map.
