Sunday Times Teaser 2633 – Magic Mushrooms

1. 
   brian gladman permalink

   Not very innovative but here it is:

   Python

   from itertools import combinations from collections import defaultdict names = ( "Anne", "Dick", "Enid", "George", "Julian", "Pixie", "Timmy" ) mushrooms = ( "Bird's Nest", "Beef Steak", "Blue Toothed", "Cannon Ball", "Death Cap", "Devil's Urn", "Inky Cap", "Old Man of the Woods", "Parasol", "Poison Pie", "Stinkhorn", "Slippery Jack", "Tree Ears", "The Gypsy" ) # dictionary giving the set of letters in a name tr = str.maketrans({' ':None, ''':None}) ltrs = { x:set(x.translate(tr).lower()) for x in names + mushrooms } # find pairs of mushroom names that share two letters pairs = set() for m in combinations(mushrooms, 2): if len(ltrs[m[0]] & ltrs[m[1]]) == 2: pairs.add(frozenset(m)) # for each person find pairs of mushrooms in which # each mushroom shares two letters with their name picks = defaultdict(set) for name in names: for pair in pairs: if all(len(ltrs[name] & ltrs[m]) == 2 for m in pair): picks[name].add(pair) # for each person find mutually exclusive pairs of mushrooms for anne in picks['Anne']: for dick in picks['Dick']: if anne & dick: continue s1 = anne | dick for enid in picks['Enid']: if s1 & enid: continue s2 = s1 | enid for george in picks['George']: if s2 & george: continue s3 = s2 | george for julian in picks['Julian']: if s3 & julian: continue s4 = s3 | julian for pixie in picks['Pixie']: if s4 & pixie: continue timmy = set(mushrooms) - (s4 | pixie) if timmy in picks['Timmy']: for n in names: print('{0:s} picks {1[0]:s} and {1[1]:s}' .format(n, sorted(eval(n.lower()))))

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56

   from itertools import combinations from collections import defaultdict   names = ( "Anne", "Dick", "Enid", "George", "Julian", "Pixie", "Timmy" )   mushrooms = ( "Bird's Nest", "Beef Steak", "Blue Toothed",               "Cannon Ball", "Death Cap", "Devil's Urn", "Inky Cap",               "Old Man of the Woods", "Parasol", "Poison Pie",                 "Stinkhorn", "Slippery Jack", "Tree Ears", "The Gypsy" )   # dictionary giving the set of letters in a name tr = str.maketrans({' ':None, ''':None}) ltrs = { x:set(x.translate(tr).lower()) for x in names + mushrooms }   # find pairs of mushroom names that share two letters pairs = set() for m in combinations(mushrooms, 2):   if len(ltrs[m[0]] & ltrs[m[1]]) == 2:     pairs.add(frozenset(m))   # for each person find pairs of mushrooms in which # each mushroom shares two letters with their name picks = defaultdict(set) for name in names:   for pair in pairs:     if all(len(ltrs[name] & ltrs[m]) == 2 for m in pair):       picks[name].add(pair)   # for each person find mutually exclusive pairs of mushrooms for anne in picks['Anne']:   for dick in picks['Dick']:     if anne & dick:       continue     s1 = anne | dick     for enid in picks['Enid']:       if s1 & enid:         continue       s2 = s1 | enid       for george in picks['George']:         if s2 & george:           continue         s3 = s2 | george         for julian in picks['Julian']:           if s3 & julian:             continue           s4 = s3 | julian           for pixie in picks['Pixie']:             if s4 & pixie:               continue             timmy = set(mushrooms) - (s4 | pixie)             if timmy in picks['Timmy']:               for n in names:                 print('{0:s} picks {1[0]:s} and {1[1]:s}'                       .format(n, sorted(eval(n.lower()))))

Comments are closed.