It's generates a maze on a tilemap with the Iterative Backtracking and solved it with the Trémaux's algorithm. It doesn't look for the shortest path it is searching for any path. In worst case it searches every path twice. The markings on the visited pathes are optional. It's only to see that it's not an aimless wandering.
If there is any interest I will clean up the code an put it to download, but I want do the effort if there is no interest.
construct.net/en/free-online-games/tilemap-maze-generator-solver-17797/play