Solution Timeline

All versions (edits) of solutions to Make this backtracking maze-generation algorithm iterative appear below in the order they were created. Comments that appear under revisions were those created when that particular revision was current.

To see the revision history of a single solution (with diffs), click on the solution number (ie. "#1") in the upper right corner of a solution revision below.

← Bounty Expand all edits

https://gist.github.com/subhashdasyam/56534c63ef0b5f0f714a5c3a162eddc4

Hi suchow,

I have modified your script slightly added the limit to the recursion, and its working now :)

Check the link

Regards
Subhash Dasyam

I believe gabrielsimoes' solution had one of the xx and yy swapped.

A similar solution that keeps the walk function:

https://gist.github.com/enj/e2d853ff2c5616ba79e63eb39cbeec4b

In my last year, i made a project in c programming that will generate a maze randomly or from a file when parameters can be (0:path/1:wall).

Also, it solve the maze to find the shortest path between two points (start/end).

The script i made, had no problem with the size!! it can work even if it's 10000 x 10000 size!! :D :D

if it's ok, i can submit it in C or we can even convert it in Python