A Perfect Maze
So I got an algorithm done last week that produced a perfect maze. Unfortunately though, I wiped my 2 x 1Tb SSD’s on my PC and didn’t back up the code.
So I am starting again.
(I’m not too good by the way, so I am documenting this)
I didn’t want a recursive algorithm because I think that on low end architecture this would be bad for memory usage. This meant that the algorithm would possibly be slower. For a 40 by 40 maze it would still be instant, even though there was a silly check in there.
Here goes. (back soon with some snippets)
I’m using AGK and will port everything to C.