title: A* with manhattan distance or euclidean distance for maze solving?
body: <p>I have obtained all the possible paths of maze through image processing. Now, I want to use A* algorithm in order to find shortest path of maze. However, I am confused as to whether euclidean distance will be a better heuristic or manhattan distance. Does it depend upon maze type or is the choice of heuristic independent of maze type? Which distance (manhattan or euclidean) will be a good choice for the following possible paths and why? Please suggest. </p>
  
  <p>PS. (Please add your reference too, if your have any. It will be helpful)</p>
  
  <p><a href="https://i.stack.imgur.com/EuI59.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/EuI59.jpg" alt="enter image description here"></a></p>