Hi to all,   
      
   we all know what are the propertie of optimality of A* on graph, with   
   no further assumption (if i remember well).   
      
   If i have a combinatorial problem with a state space modeled with a   
   tree, than is A* still an optimal algorithm?   
      
   I think that the answer is yes...   
      
   So there are no deterministic search algorithm that can be better than   
   A* with the same heuristic...uhm...   
      
   Thanks   
      
   [ comp.ai is moderated ... your article may take a while to appear. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)