Initial position row=3, column=1 This map has many possible paths, the algorithm stops when it finds a possible path from initial position to the goal. It does not have to be the best shortest path. One possible solution: (3,1) -> (3,2)-> (3,3)-> (4,3); Or (4,3)-> (3,3) -> (3,2)-> (3,1)