From: eddie901@gmail.com   
      
   I have a problem with this classic problem. Many cite the solution   
   takes 11 steps but my program tells me there's a 9-step soln.   
      
   Start   
   -> moving 1 M and 1 C across [M 2]:[C 2]:[B false]   
   -> moving 0 M and 1 C back   [M 2]:[C 3]:[B true]   
   -> moving 2 M and 0 C across [M 0]:[C 3]:[B false]   
   -> moving 1 M and 0 C back   [M 1]:[C 3]:[B true]   
   -> moving 1 M and 1 C across [M 0]:[C 2]:[B false]   
   -> moving 0 M and 1 C back   [M 0]:[C 3]:[B true]   
   -> moving 0 M and 2 C across [M 0]:[C 1]:[B false]   
   -> moving 1 M and 0 C back   [M 1]:[C 1]:[B true]   
   -> moving 1 M and 1 C across [M 0]:[C 0]:[B false]   
      
   Goal found at depth 9   
   [M 0]:[C 0]:[B false]   
      
   I guess it depends how you interpret the constraints on legal states. I   
   assume no Ms or Cs can be outnumbered unless the boat is present.   
   Does anyone have any thoughts on this?   
      
   Thanks.   
      
   [ comp.ai is moderated.  To submit, just post and be patient, or if ]   
   [ that fails mail your article to , and ]   
   [ ask your news administrator to fix the problems with your system. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)