title: An algorithm to find the shortest and best path in a grid for a robot linefollower
body: <p>I need to write an algorithm to find the shortest path to a coordinate in a grid. For example, a robot is at point (2,4) in a grid (imagine a Cartesian coordinate system), and the robot needs to go to point (5,8). But the robot can't go through all the points. The robot must identify the shortest way to go to the specified point.</p>