HaKai-2062 / Mazes

Creating and Solving mazes using various algorithms

Mazes

Features

• Shift and left mouse click is used to select the start cell indicated by green.
• Shift and right mouse click is used to select the end cell indicated by red.
• Dockable window and maze is automatically adjusted according to available viewport space.
• Mazes aka labyrinth can be generated using 4 building algorithms: Recursive Backtrack, Kruskal, Prints, Wilson.
• 4 solving algorithms can be used to get path from start cell to end cell: DFS, BFS, Dijkstra, A(*) star.
• Maze dimensions including cell width and wall width can be tweaked.
• Colors of the maze can be tweaked and path drawn has color cycling by default. It can be further tweaked by user.
• Visualize tab includes cell weights which can be used to assign random weights. Useful for Dijkstra and A star alogirthms.

Libraries

• GLFW
• Glad (gl 3.3, OpenGL, Core profile)
• imgui (docking branch)
• implot

Tools Used

• CMake
• Visual Studio

Building the project

• Open the project directory inside Visual Studio.
• Open the CMakelists.txt file located in the project folder and Ctrl+S. This will clone and build the dependencies.
• In case of CMake related issues, delete 'out' folder and try rebuilding.

Maze Building Algorithms

Recursive Backtrack and application delay

Kruskal

Prims

Wilson

Maze Solving Algorithms

Depth first search

Breadth first search

Dijkstra

A(*) star

Miscellaneous

Dockable window. cell width and wall width can be tweaked for maze size and look.

Path color cycle speed and cell weights being tweaked and heatmap for visualization