title: Program a heuristic function for A* algorithm
body: <p>I have to program a robot to find the shortest distance to the goal location. In an arena which contains obstacles at random locations(not known beforehand). </p>
  
  <p>The problem is, I will be given an array representing a grid. In this grid, 0 stands for movable space, 1 for obstacle. I have to program it to find the shortest path to the goal location of my choice, avoiding all the obstacles(walls).</p>
  
  <p>Is A* a good approach for this problem or is there even a better approach?</p>