A stackless floodfill automation (2023)
28 points by pushcx
28 points by pushcx
This seems pretty close to an old algorithm for drawing mazes that I used back in high school on my Apple II. I would never have thought to apply it to flood-fill, though.
Don't suppose you have that algorithm lying around? I'm in a bit of a procgen maze mood at the moment and the more the merrier...
Oh, it’s pretty simple. Go on a random walk, not visiting any cell twice, and when you get stuck, backtrack. It was fun to watch in real time (BASIC on an Apple II was not fast!)
Having difficulty accessing the paper in question, but is it not the point of it that you're avoiding the backtracking step, which requires a stack?