Learnacy Lab
Turn a grid maze into a graph (cells are nodes, open neighbours are edges) and a breadth-first flood finds the shortest way through.