title: Greedy Best First Search - Loops (Romania example)
body: <p>I was reading some literature regarding the Greedy Best First Search I encountered many times the road map of Romania as an example application (see <a href="http://csc.lsu.edu/~jianhua/AI-Chap3-con.ppt" rel="nofollow">here</a> on slide 5)
  . </p>
  
  <p>It is often stated, that the greedy best-first search algorithm can get stuck in loops. This seems logical to me. However, as an example the loop Iasi -> Neamt -> Iasi ... is given (slide 11). I don't see why, because the used heuristic (straight line distance) yields a larger value for Iasi then for the other neighbor of Neamt. </p>
  
  <p>First I thought this is an error, but I found multiple sources giving this loop as example. What am I getting wrong?</p>
  
  <p>EDIT: The goal in these examples is usually to get to Bucharest</p>