From: tentacle@zahav.net.il   
      
   Hi,   
   I am puzzled with these two questiong I got on an AI course assignment.   
      
   The first one asks me to present a problem for which is it hard to determine   
   if a given state is a target state? I was thinking about optimization   
   problems... Anyone have pointers that can help with this?   
      
   The second question goes like this:   
   As we have seen, its not easy to find a solution for the Hanoi Towers   
   problem. Lets change the problem a bit, and instead of asking "what is the   
   way to move the discs?" we'll ask "Is it possible to move them?". meaning:   
   given a legal arrangement of the discs can all of them be moved to the right   
   column? describe an algorithm that solves the problem.   
      
   I havent managed to find an arrangement for which the Hanoi problem isn't   
   solvable (and I think I can prove one does not exist). So my algorithm   
   should be "return true;" which is kinda wierd and makes me think I   
   overlooked something...   
      
   Thanks,   
   Eran Kampf   
   http://www.ekampf.com   
      
   [ 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)