-
path-algorithms-on-a-grid-map
A solution that solves a problem of finding path on a grid representing any kind of maps from small and virtual maps to more like real maps (see screenshots for examples).
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
Therefore, I forked the repository and based my solution on it. Kudos to @razimantv for the elegant OOP design, which allowed me to customize the results to create visually appealing images using the SFML library or generate a text file with the necessary map description for my Wall-E project.
While it would have been enticing to implement various maze generation algorithms to compare them, I also wanted a more efficient approach. The quickest solution I found involved randomly selecting connected cells. That's precisely what I did with mazerandom. This one-file application creates a grid table of 20 x 20 cells and then randomly connects them using a Depth-First Search (DFS) traversal. In other words, we're simply carving passages in the grid.
I discovered a well-designed mazegenerator codebase by @razimantv that accomplishes this, generating mazes in SVG file format.
I also added comments throughout the codebase for easier comprehension, so I don't need to explain it in every detail here. The main pipeline can be found in \mazegenerator\maze\mazebaze.cpp:
Related posts
-
Advice on How to Procedurally Generate a 3D/Multi-Sided Maze
-
Can someone review a code I found on GitHub and tell me how I can use it?
-
CLI maze generator with multiple shapes, tiling and other options
-
CLI maze generator with multiple shapes, tiling and other options
-
Create beautiful mazes, easy-to-use, composable and configurable CLI