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.
The Maze generation software "Daedalus", version 3.5
Project of a micromouse type mobile robot based on STM32 and designed PCB. Master's thesis.
Recursive Backtracker Maze Generation Algorithm with C++ using ncurses
A Python wrapper of the Daedalus maze generator.
A generic C++ implementation of a Maze data structure along with maze solving algorithms using graphs.
C++ 课程设计项目，基于 Qt 制作的一个简单的走迷宫小游戏
BP course final project
A maze solver library for micromouse
🐀A maze generator is a flexible size random maze implemented using Union Find Set (Disjoint Set)
Introducing to the world - Maze Game! A game with an easily accessible, user-friendly interface that will provide you the serotonin a game should!
Maze generation, solving & finding shortest paths algorithms with backtracking, written in C++ and SFML.
micromouse maze manipulation library in C/C++
A tool for generating mazes
This repository contains maze building and solving algorithms. The solvers are multithreaded.
Maze Solving algorithm detects the various nodes in a maze formed with black lines using a line follower robot to computes the best path for minimum turns between start to end points.
A Maze generated with Backtrack Algorithm
Maze Generator and Solver Welcome to the Maze Generator and Solver project! 🚀 This C++ application, powered by SDL2, creates and solves mazes with captivating visuals. Experience the beauty of algorithms as you watch mazes being generated and solved before your eyes. Ready to dive in? Let's get started!
マイクロマウス
This repository contains source code for ENPM809Y final project on search algorithm for autonomous robots moving on a 2d maze. The source code is in C++ 11. The maze will printed on the terminal and the user shall be prompted to enter the locations of two robots and also two targets. Later, the user will be asked to assign task for one of the ro…