Outils de génération et résolution de labyrinthes
-
Updated
Oct 23, 2017 - C
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.
Outils de génération et résolution de labyrinthes
MST/maze generation by Kruskal's, Prim's and Boruvka's algorithm in C
The following C code will generate a random maze and solve the maze using Linked List Data Structure
unix command maze: generating a maze
game-dev project based on SDL-C with the goal to develop a maze-escape game with procedural generated maps
The goal of this projects was to develop 2 maze generator (perfect, non-perfect) and 3 maze solver (deep-first search, breadth-first search, A star).
Maze generator/solver (backtracking implementation)
Implémentation d'un Labyrinthe avec Langage C avec la bibliothèque SDL . Ce projet utilise l'algorithme de fusion aléatoire des chemins (Randomized Kruskal's algorithm ) pour générer un labyrinthe parfait et l'algorithme de recherche en profondeur recursive ( DFS recursive ) pour le résoudre .
First-person maze-navigation game for the Pebble smartwatch
UCS and A* algorithm implementation for maze solving.
A "random 2D maze" game, navigate through it in 3D
Implementing labyrinth & visualization of DFS & BFS
Maze solver and generator algorithms.
maze generation using random depth-first search implemented via a stack
A maze raycasting game
Maze generator using the Kruskal algorithm and a partially working solver
Maze generator & Dante algorithm solver