Maze generation code, inspired by Mazes for Programmers.
-
Updated
Jul 4, 2020 - Clojure
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 generation code, inspired by Mazes for Programmers.
Implementing Reinforcement Learning, namely Q-learning and Sarsa algorithms, for global path planning of mobile robot in unknown environment with obstacles. Comparison analysis of Q-learning and Sarsa
Maze algorithms implemented in CoffeeScript, with an eye toward demonstrating how the algorithms work by animating them.
A maze generator, solver and visualizer for Python
A Python library for creating and solving mazes.
Create aesthetic mazes of different shapes, tiles, sizes and more using a CLI tool. A website is also available at https://mazes.apixelinspace.com
A comprehensive library of algorithms for creating perfect mazes.
The Maze generation software "Daedalus", version 3.5
Generate Mazes of different types and Datasets for Deep Learning (GANs, RL)
Recursive Backtracker Maze Generation Algorithm with C++ using ncurses
Maze algorithms in Clojure (from Jamis Buck's "Mazes for Programmers" book)
Project of a micromouse type mobile robot based on STM32 and designed PCB. Master's thesis.
A Python wrapper of the Daedalus maze generator.
🏰 The Maze Game offers straightforward maze navigation challenges, built with Prim & DFS Algorithms. Featuring responsive design for easy play on any device, including mobile, with intuitive on-screen controls for movement, it's ideal for quick gaming sessions, providing both casual and challenging experiences!
All my working experience with p5js
An Arduino micro controller based robot which first analyzes the maze in the dry run by following lines through IR sensors and then calculates the shortest path from the source to the destination.
Solves Mazes taking an image input, along with the starting and ending points. There are two Algorithms here which solve mazes. One of them is a Shortest Path Algorithm, the other, Minimal Tree Agorithm along with dead end filling.
A generic C++ implementation of a Maze data structure along with maze solving algorithms using graphs.
Java library for maze generation
A collection of maze generation algorithms