Roger Hui asks for solutions to the logic came called Sett. The following is

a solution in J. It uses an auxiliary function 'comb' which is the well-known

Hui function to generate all x!y combinations of y things taken x at a time.

NB. arg is deal =. 12 ? deck =. 81.

NB. Try ans=.Sett deal (which gives triplets of items of deal)

NB. then g ans to see that the items of ans indeed solve the problem.

w=.k#]

i=.e.&0 5 7 11 13 15 19 21 26 NB. winners

j=.3:#.[:|:"2]

g=.3 3 3 3&#:

c=.(3 comb 12)&{

Eugene McDonnell