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
A Micromouse simulator: write and test maze-solving code without a physical robot
C++ Bitmap Library https://www.partow.net/programming/bitmap/index.html
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.
Project of a micromouse type mobile robot based on STM32 and designed PCB. Master's thesis.
An app that can solve a maze based on its image.
C++ maze generator using recursive backtracking.
Arduino nano based micro-mouse
Project about a game for the Babylon tower. Powered by olcPixelGameEngine.
WebAssembly game: a sliding block adventure.
Maze generation and solving library
这是一个偏沙盒的迷宫游戏,尽可能兼容各操作系统和语言。It's a sandbox-oriented maze game, as compatible as possible with every operating system and language.