title: Word search algorithm
body: <p>I am trying to come up with a better approach than the "brute force" method, but am at somewhat of a loss.</p>
  
  <p>Here is a simple case:</p>
  
  <p>Given a finite number of pre-chosen letters, and a hatch (like a crossword overlap) I am attempting to find all combination of words that can be used. (Words are retrieved from a dictionary database.)</p>
  
  <p>Example:</p>
  
  <p>Given the letters:<br /> 
  a,c,r,e,t,u,p,l,m,o<br />
  how many combinations of words can fit in the following crossword puzzle?</p>
  
  <pre><code>   _
   _ _ _ _ 
     _
     _
     _ _ _
  </code></pre>
  
  <p>One example:</p>
  
  <pre><code>  c
  t r e e
    e
    e
    p o t
  </code></pre>
  
  <p>Of course the search time increases dramatically with each letter or addition to the crossword hatch. Any suggestions for a better way to search?</p>