title: Hill climbing algorithm simple example
body: <p>I am a little confused with Hill Climbing algorithm.
  I want to "run" the algorithm until i found the first solution in that tree ( "a" is initial and h and k are final states ) and it says that the numbers near the states are the heuristic values. Here's the tree:</p>
  
  <p><img src="https://i.stack.imgur.com/ujh8Z.png" alt="enter image description here"></p>
  
  <p>My question :
   i am trying to run hill climbing on the  tree, so ok we start a-> f-> g and then what ??finish(without result) , but I read that hill climbing can't go back and make a new choice(example j or e) ? Is this right ?
  If i can go back then how ? i mean where we change our initial choice example we choose e instead of g or j instead of f</p>
  
  <p>Sorry if my question is too simple .</p>