A* algorithms for 2D gridmaps. The fastest one, until you prove me wrong
-
Updated
Nov 6, 2019 - 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.
A* algorithms for 2D gridmaps. The fastest one, until you prove me wrong
The Maze generation software "Daedalus", version 3.5
Project of a micromouse type mobile robot based on STM32 and designed PCB. Master's thesis.
Arduino nano based micro-mouse
An app that can solve a maze based on its image.
A generic C++ implementation of a Maze data structure along with maze solving algorithms using graphs.
Project about a game for the Babylon tower. Powered by olcPixelGameEngine.
Maze generation and solving library
An Arduino microcontroller-based robot first analyzes the maze in the dry run by following lines through IR sensors and then calculates the shortest path from the source to the destination.
Maze solver and line follower with 90 and 135 degree turns
A DFS-based maze generator and solver.
This C++ program generates mazes using randomized DFS and solves them using the Wall Follower and A* algorithms
An Arduino line following maze solver which utilizes PID control to ensure stability. The robot can record the shortest path to the exit, and follow said path in future rounds.
implementation of informed and uninformed search algorithms: UCS, IDS, A*, Bi directional A* and IDA*.
Maze Solving Car Robot using Arduino Uno
Maze generation, solving & finding shortest paths algorithms with backtracking, written in C++ and SFML.
All the project files related to the development of an autonomous mobile robot using Webots simulation platform for UOM's EN2532 - Robot Design and Competition Module ✨🚗✨
Maze Solving Line Follower-Arduino Project