title: What's the difference between best-first search and A* search?
body: <p>In my text book I noticed that both these algorithms work almost exactly the same, I am trying to understand what's the major <em>difference between them</em>.</p>
  
  <p><a href="https://i.stack.imgur.com/9xMUF.png" rel="noreferrer"><img src="https://i.stack.imgur.com/9xMUF.png" alt="Example from the textbook"></a></p>
  
  <p>The textbook traversed this example using <em>A*</em> the same way it did with <em>best-first search</em>.</p>
  
  <p>Any help would be appreciated.</p>