Need help with finding the shortest coordinate of a maze
Hi I have a 16x16 maze where 1's represent walls and 0's represents paths.
I used a breadth first search algorithm and my program successfully finds a path from a user specified start to a user specified exit.
However I am stuck on how to output the shortest path using a coordinate system.
Checking the paths that the computer took, I could see that it tried many dead ends before it could find the exit. How would I skip those dead ends and make it output a path leading from the start to end?