An implementation of BFS, DFS, and A* search in Python
-
Updated
Jan 20, 2017 - Python
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.
An implementation of BFS, DFS, and A* search in Python
Solves Newspaper Like Mazes, while traversing provided markers ( checkpoints ) along the path
Gimme a maze and I will solve it!
Generates a maze, as well as its solution. The maze is generated using recursive backtracker, and the solution is found using DFS.
LaserMaze Application
Génération de labyrinthe (différents type d'algorithme) sous python
Maze generator (that can generate a maze of custom size) and solver (though graph analysis)
This is a simple Smart Maze Bot created Using Genetic Algorithm in Python
My Java Projects
An implementation of a maze generator and a maze solver, using the A* algorithm.
My mini-projects done attempted being part of Robotics Club @ SASTRA
Maze solver in python
Theta maze solving using image processing with OpenCV and numpy libraries. Implented a variant of the Breadth First Search algorithm to solve the maze in the polar coordinate system.
Rectangular maze solving using image processing with OpenCV and numpy.