Mazes for Programmers book source code & examples, rewritten and adapted to Python
-
Updated
Jul 25, 2024 - 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.
Mazes for Programmers book source code & examples, rewritten and adapted to Python
🏰 The Maze Game offers straightforward maze navigation challenges across multiple difficulty levels. It features responsive design for easy play on any device, including mobile, with intuitive on-screen controls for movement. Ideal for quick gaming sessions, providing both casual and challenging experiences.
A selection of maze generators based on Mazes for Programmers by Jamis Buck. Written in Python. Exported as ASCII and SVG
Use MakeCode to build and solve random mazes in Minecraft.
Python implementation of algorithms described in Mazes for programmers
StrinGame is a blind maze-solving adventure created entirely using the Pygame library and other Python modules, including the audio components. Experience the thrill of exploration and strategy in this traditional game with a new twist
A visual pathfinding program that allows the user to create their own obstacles or mazes and then run different pathfinding algorithms on it.
3D cube maze solver with terminal-adjusted visualisation and a maze generator
Solve mazes and measure your time to complete them as fast as you can.
Mazegenerator for black and white images
A python program to find the route to cross a maze
Python code for "Mazes for Programmers" by Jamis Buck.
Tabular RL Simulation Repo for Binary Search
A maze solving algorithm
Maze Generation/Solver API and Renderer
Pathfinding algorithms on mazes - Programming exam project
Creates fully connected solvable mazes and solves them with dead end canceling strategy.
A maze is a path or collection of paths, typically from an entrance to a goal. The word is used to refer both to branching tour puzzles through which the solver must find a route, and to simpler non-branching patterns that lead unambiguously through a convoluted layout to a goal.