Consider the logic problem that asks you to determine the number of cards in each suit of a hard of playing cards. Generalize the problem so that the number of cards in the hand and the number of cards in the pairs of suits can be set by the questioner. Then change the requirement that defined the trump suit to be that the suit with the smallest number of cards.
  1. What is the new statement of the problem?
  2. Write the algorithm to solve the general problem based on the quicker solution used herein.

Print your answers on single sheet of paper with your name on top and on the outside, fold and bring to class next time.


Last updated 2000/01/23
© J.A.N. Lee, 2000.