title: A* manhattan distance
body: <p>I searched for the algorithm/pseudocode of A* I followed it and coded it. I used Manhattan distance for h(n). ( f(n) = g(n) + h(n) )
  And this is the result,</p>
  
  <p><img src="https://uploadir.com/u/0yltnqj4" alt=""></p>
  
  <p>This always happen when there are no walls blocking the way, but when I put a lot of walls, it seems that it's taking the shortest path. Is this one the shortest path? I mean why is it not like this one below?
  <img src="https://uploadir.com/u/ghfcrs9w" alt=""></p>
  
  <p>This one is also A* Manhattan, and they have the same size (19x19). This is from <a href="http://qiao.github.com/PathFinding.js/visual/" rel="nofollow noreferrer">http://qiao.github.com/PathFinding.js/visual/</a></p>