I have written a simple program in C++ that randomly generates a perfect maze using Depth-First Search (DFS) algorithm. A perfect maze is defined as a maze which has one and only one path from any point in the maze to any other point. This means that the maze has no inaccessible sections, no circular paths, no open areas.
Double array of structs was used for the navigation grid in X and Y coordinates, stacks was used to back-track the path by popping the last position, and ofstream was used to output and save the generated maze into a specified file.
Hye...do u still have the coding for this?
If yes...can u pm me the code?
minahlepak 11 months ago
That is amazing! Good work!
j7512 11 months ago
hello...can i have some copy of your codes????
maui008 11 months ago
hey can i have some copy of your codes i just want some ideas....thanks
maui008 11 months ago
can i have the code? i really need it ! thx !
extrahotchillimansi 11 months ago
How you saved your 2D array to *.txt file?
MasterKEnnY2009 1 year ago
Hey Mate
can you please provide more technical detail in relation to filling the gap with dots between the star and the ending point (Search and fill algorithm)
cheers
NHD78 1 year ago