Custom Maze Generation with DFS and Finding Shortest Path
-
Updated
Apr 19, 2023 - JavaScript
Custom Maze Generation with DFS and Finding Shortest Path
Pathfinding algorithms optimized for two-dimensional map traversal
🕹 Implementation of a 8 puzzle game using traversal algorithms.
It demonstrates the use of a single "for-loop" in traversing three-dimensional arrays. The example shown here is made in Javascript.
Add a description, image, and links to the traversal-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the traversal-algorithms topic, visit your repo's landing page and select "manage topics."