Jostein Brændshøi

I agree, this sounds very cool! @ThomasThelen In the example I think it is 5 rows and 2^(5+2) = 128 columns by @kkaushikvarma logic (although I don't understand the "+2"...

Great effort! I merged the pull request now. I agree, the choice of columns = 2^(int(row/2)+2) seems to work great. Impressive work on both the cells and generation as well...

Okay, yeah, I see what you mean. Might need a little restructure nefore it should be merged with`master`. Reverted the pull request now.

This sounds interesting and would be really cool to make work. At the moment I don't have the time to work on this. In general I have to focus on...

All good. :) I'm sorry I'm not able to contribute more these days. Im'm quite stressed with the project. Next thing I'll to is try to fix the failing unittest...

Thanks for noticing. I'll take a look at this when I have the time.

The path variables contains solution coordinate paths so we have the solution path, the length of this would be the number of steps. I agree, there are definitely possible enhancments...

This seems like a cool idea, but way above my level of comprehension and skills at the moment.

Thanks for all your suggestions and contributions! Yes, initially I didn't think of including more algorithms so I just had everything maze stuff in the Maze class, but yes, creating...

Also, I very recently added support for a breadth-first search solver as well as a (yet not fully functioning) bidirectional depth-first solver.