From: ted.dunning@gmail.com   
      
   There is an enormous literature on this topic that is very accessible.   
   The one-sentence summary is that there isn't a single best algorithm   
   and what works for checkers doesn't work as well for other two person   
   games.   
      
   The reason for the second conclusion is that the number of games of   
   checkers is massively smaller compared to even chess and the number of   
   chess games is massively smaller than the number of Go games.  This   
   means that the simple move tree searching algorithms that work well for   
   checkers work less well for chess and fail entirely for Go.   
      
   Have you looked at the basic references on the topic?   
      
   [ 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)