DMGsquared

Devlog #6
Just made some minor changes to allow it to work better with my next project that’ll utilize this ;).

Devlog #5
Fixed a huge resource leak that allowed the program to go from 3.5 minutes per 100 maps -> 1.1 minutes per 100 maps. Also added more customization and simplified the process.

Devlog #4
Finally finished the random generation and added a collection process to generate multiple maps and then store/collect them into an array. Needs some optimization though - 3.5 minutes per 100 maps =( .

Devlog #3
My program was getting big, so optimization was due. I managed to optimize the Map Generation and fix some of the bugs in the Pathfinding algorithm.

Fixed a bunch of issues with my code and finished implementing a complete random gen and pathfinding using A*. Though i am having issues with the H/F value calculation using diagonal distance.

I have already started it and have implemented the basic drawing, randomization, and basic pathfinding using A*.