I am trying to code a path finding function in c++ . It should work like that, you supply the start point (x1,y1) and the end point(x2,y2) and it returns a list of points for the shortest path.
Assume that i want to go from the red tile to the blue one, however the grey tiles can not be walked on (like walls) .
