Wait a minute... I recognize that unicursal maze... That's 0404-01C-422! Well, actually, it's the derivative of that maze (derivative pair #01H). Or it could be the undetermined equivalent, 0404-00C-334243! That would make more sense, considering the person is likely the starting point and is walking towards the statue. Very Nice! How did you make that, by the way?
I decided to map out the maze just to see what its official designation would be as an Inverted Derivative Determined. Granted, I don't do a lot with inverted mazes (where the start point and end point are switched) or derivates, for that matter, but I thought that it would be fun. Anyway, it would be "ID-0404-01H-33-C." I should start investing more time into studying inverted mazes...
every maze is generated in runtime using a recursive depth-first search. try fiddling with the width and height, it sets random start and end points. some configurations have no solutions, try anything at the minimum width or length.
@asterion this script might interest you: https://daliwali.neocities.org/documents/maze-solver.js <- backtracking DFS unicursal maze solver. time complexity to find all solutions is extremely bad: O(4^(n^2)) which i don't think can be improved, it could only be made to run faster, maybe with AVX-512 or a GPU compute shader.
![notFuji[ไธ่ค] avatar](/site_screenshots/14/11/notfuji/index.html.50x50.webp)
Something something bluesky and you're bad and stuff. Lol
Wait a minute... I recognize that unicursal maze... That's 0404-01C-422! Well, actually, it's the derivative of that maze (derivative pair #01H). Or it could be the undetermined equivalent, 0404-00C-334243! That would make more sense, considering the person is likely the starting point and is walking towards the statue. Very Nice! How did you make that, by the way?
I decided to map out the maze just to see what its official designation would be as an Inverted Derivative Determined. Granted, I don't do a lot with inverted mazes (where the start point and end point are switched) or derivates, for that matter, but I thought that it would be fun. Anyway, it would be "ID-0404-01H-33-C." I should start investing more time into studying inverted mazes...
every maze is generated in runtime using a recursive depth-first search. try fiddling with the width and height, it sets random start and end points. some configurations have no solutions, try anything at the minimum width or length.
@asterion this script might interest you: https://daliwali.neocities.org/documents/maze-solver.js <- backtracking DFS unicursal maze solver. time complexity to find all solutions is extremely bad: O(4^(n^2)) which i don't think can be improved, it could only be made to run faster, maybe with AVX-512 or a GPU compute shader.