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
Generate mazes with exactly one solution and draw them nicely on a canvas.
Python code for "Mazes for Programmers" by Jamis Buck.
A interactive Maze-Generator using Depth-First-Search and recursive backtracking, written in P5JS.
Tabular RL Simulation Repo for Binary Search
A maze solving algorithm
Processing Implementation of the book Mazes for Programmers
TypeScript implementation of the book Mazes For Programmers by Jamis Buck
A web app to create, play and solve mazes
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.
Visualization tool for maze generating algorithms