In a version of the game of set, cards with shapes on them are dealt out and each has four characteristics:

Type of shape (Circle, Square, or Triangle)
Color of the shape (Red, Blue, or green)
Fill type (Empty, Half filled, or Completely filled)
Number of the shape on the card (1, 2 or 3)

A "set" is defined as a three card subgroup of the cards "in play" such that for each of these four individual characteristics are either all the same, or all different. (The cards could be all different on one characteristic and be same on another.)

What is the greatest number of different cards that can be "in play" such that there is no subgroup that can be designated a "set"?

(In reply to Complete Proof by Tristan)

Yes, well, my proof is wrong.  Why?  All those 15s should be 40s.  I completely miscounted the number of possible sets that include any one card.  That also means that there are 27*40 or 1080 sets in a complete deck.  I'm still quite sure that 16 is the answer, but cannot prove it.

Posted by Tristan on 2004-05-15 10:56:22