title: Heuristic algorithms in prolog
body: <p>i'm not very experienced on Prolog and i'm trying to solve an exercise that's about using a heuristic algorithm(f.e. A* or BFS or Hill-Climbing) to find a solution to a given problem.  </p>
  
  <p>Since i'm not familiar with this kind of programming and a search in google didn't really help me,i was wondering if anyone could give me a link to a similar already solven example to see how this is done.<br>
  I'm not trying to copy anything,it's just that I did study a lot about prolog commants etc. and i do know how these algorithms work in theory and how they solve the problem(f.e. in my exercise i think BFS or A* would be good choise) but i don't understand how i am supposed to compose a program in prolog that actually uses an algorithm and gives a solution.</p>
  
  <p>Just a clarification,i really believe that real prolog-code examples would be very useful and not theoritical explanation of how an algorithm works.I do kwon how the problem is supposed to be solved,making it happen and particularly in prolog is what i fail to understand..  </p>
  
  <p>Thnx in advance..</p>