I’m making a bit of headway on my maze generator. I use a very simple recursive backtracking (random depth first search) approach to carve the maze. See here for info about it. Once I get back to Chicago I plan on working on implementing the exit choosing portion of the generator. The idea is to find the length of all the paths from the start of the maze (grey square) to each dead end. The dead end that is the furthest from the start will be made the exit. This requires me to do a depth first search over the tile map from the start to each dead end - keeping track of path lengths, and then selecting the furthest. Finally my maze will have more than just a lonely start position.
I also plan on selecting at random a few dead ends, and connecting them back into the maze somehow to make things more confusing. But we’ll see.
For those interested, the C++ code can be found on github in this repository. I am using git seriously for the first time, and I think I am starting to hit a stride with the help of this as well as this. I’m trying to use this project as a way to brush up on my long forgotten C++ skills - progress is slow!
