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
MGFX - A cross-platform 2D (CPU & GPU) and 3D (GPU) starter kit.
Recursive Backtracker Maze Generation Algorithm with C++ using ncurses
A Python wrapper of the Daedalus maze generator.
C++ maze generator using recursive backtracking.
Project about a game for the Babylon tower. Powered by olcPixelGameEngine.
A maze generator written in Dart and Flutter.
Maze generation and solving library
A DFS-based maze generator and solver.
A Recursive VS Iterative Dynamic Backtracking Maze Generator with C++
这是一个偏沙盒的迷宫游戏,尽可能兼容各操作系统和语言。It's a sandbox-oriented maze game, as compatible as possible with every operating system and language.
Introducing to the world - Maze Game! A game with an easily accessible, user-friendly interface that will provide you the serotonin a game should!
A random maze generator programmed in C++.
An example project for 'Procedural Generation Of Mazes In Unreal Engine' series at GameDev.tv Blog
🐀A maze generator is a flexible size random maze implemented using Union Find Set (Disjoint Set)