XPost: comp.lang.python, sci.math   
   From: HenHanna@devnull.tb   
      
   given (a list of 3-letter words)   
      Dict=(act, ATT, eat, sat, sit, cat, bat, dog, god, mat, tim, kim, ...)   
      
   The object is to make a long chain (no repeats) with 2-letter overlaps.   
      
                                  e.g. -- [cat, ate, tea, eat, ATT, ...]   
      
      
      
   What's a good approach (in Python)?   
      
      
                 in Mathematica, it's easy to find   THE Longest    chain?   
      
                                is this a typical NP-complete problem?   
      
   ________________   
      
   -- Martha has aspirin in industrial allotments.   
      
   -- Two women enter erotic icehouse, seduce celibate teacher.   
      
   -- Rush showed editorial alarmism, smeared educational alliance ceaselessly.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)