Generate mazes of different shapes and arbitrary sizes using graph theory
-
Updated
Nov 1, 2023 - C++
A maze is a type of puzzle involving a collection of paths, usually where a player has to find a route from start to finish.
A huge variety of algorithms exist for generating and solving mazes. These are not only fun to implement, but also are a good way to familiarise yourself with programming techniques, algorithms, and languages.
Generate mazes of different shapes and arbitrary sizes using graph theory
Collection of maze generation algorithms.
The Maze generation software "Daedalus", version 3.4
Recursive Backtracker Maze Generation Algorithm with C++ using ncurses
A Python wrapper of the Daedalus maze generator.
An example project for 'Procedural Generation Of Mazes In Unreal Engine' series at GameDev.tv Blog
MGFX - A cross-platform 2D (CPU & GPU) and 3D (GPU) starter kit.
Final Project Computer Graphics Courses
An OpenGL 2D maze game
Generador recursivo de laberintos perfectos
A Dungeon Crawler like game made in vanilla C++.
A DFS-based maze generator and solver.
Maze generation and solving library
A C++ implementation of a NxN maze generation and solving (either by an algorithm or by user).
A maze generator using the recursive backtracking algorithm for generating the maze and SFML for graphics
C++ maze generator using recursive backtracking.
DSA Project
A Recursive VS Iterative Dynamic Backtracking Maze Generator with C++
This projects contains maze generator using Qt/C++ .
A simple visualization of Dijkstra finding the shortest path in maze