some implementations of maze solvers
mazes are generated with prim's algorithm to create a minimal spanning tree (i.e. every passage is connected to every other passage through 'exactly' one path)
all mazes are solved from the top left to the bottom right

restart_alt pause play_arrow fast_forward

selected solver:

chevron_left

dfs

chevron_right
depth-first search

depth-first search uses a stack to continue searching from the longest known path. while it doesn't matter in this case (as all mazes have exactly one solution), dfs is not in general guaranteed to find a minimal length solution.