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.
Pathfinding visualizations with Python and Pygame
Mazes for Programmers book source code & examples, rewritten and adapted to Python
A depth-first search maze generation algorithm implemented with recursive backtracking
Program to generate different kind of Mazes
Automatically creates a solution to a randomly-generated maze using Pyhop, a Hierarchical Task Network Planner created by Dana Nau based on the SHOP algorithm. Built for artificial intelligence research.
Python implementation of algorithms described in Mazes for programmers
GUI and console maze generator
Visualization for the following algorithms: A* Search, Bredth First Search, Depth First Search, and Greedy-Best First Search. In addition to Recursive and DFS maze generation.
A Python-based maze generator that visualizes maze creation in real time using pygame. It supports classic algorithms like Depth-First Search and Prim’s Algorithm, includes a clear start and exit, and exports mazes in a JSON format compatible with a separate Maze Solver project.
Interactive Python game involving maze generation with Prim’s, Kruskal’s, DFS, and Random Walk algorithms, with recursive backtracking for maze solving
This is a autogenerated maze game where you dont seek to get out.
A script for generating a 2D maze in which there is one and only one path between any two points.
python implementation of maze generation and solving
A maze solver built using Python. it generates and solves random mazes using a recursive backtracking algorithm.
A simple maze creator and solver in Python
Maze generator in python
Finding paths between 2 points
A little maze game built with the Pyxel game engine.
The following project looks at mapping out a base maze. Implements a recursive algorithm(DPF) to mow the maze. In addition, Breadth First Search is implemented in order to drop "candy" along the path, which the user can pick up while solving the maze.
Visualizer for maze generation and pathfinding algorithms .