Maze generating algorithms using WebAssembly and Go
-
Updated
Feb 21, 2020 - JavaScript
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.
Maze generating algorithms using WebAssembly and Go
Java implementation of the code from the book Mazes For Programmers by Jamis Buck
Python code for "Mazes for Programmers" by Jamis Buck.
A interactive Maze-Generator using Depth-First-Search and recursive backtracking, written in P5JS.
Generate mazes with exactly one solution and draw them nicely on a canvas.
A Java application which generates labyrinths with Prim's algorithm and solves them with BFS and DFS
Python implementation of algorithms described in Mazes for programmers
A maze solving algorithm
Processing Implementation of the book Mazes for Programmers
Use MakeCode to build and solve random mazes in Minecraft.