💢

Pathfinder environment with mazes

https://graph-theory.sanchezcarlosjr.com/

References

https://github.com/diogofferreira/pacman-3d
https://github.com/clementmihailescu/Pathfinding-Visualizer
Route-finding (article) | Algorithms | Khan Academy
If you're seeing this message, it means we're having trouble loading external resources on our website.
https://www.khanacademy.org/computing/computer-science/algorithms/intro-to-algorithms/a/route-finding

http://sbgames.org/sbgames2012/proceedings/papers/computacao/comp-full_09.pdf

https://en.wikipedia.org/wiki/Maze-solving_algorithm

https://www.khanacademy.org/computer-programming/program/5157014494511104/embedded?embed=yes&author=no&editor=yes&buttons=yes&settings={}

https://www.shadertoy.com/view/Ms3XWN

https://github.com/Hash-Mountain-Studio/Toxic-Man

Requirements

Functional requirements

NameTags
Show a 3D maze.
Show a 2D maze.
Show a 3D pacman
Compile algorithm to JS function
Pathfinder algorithm: Dijkstra
Maze generator (MST): Prim’s AlgorithmPerfomance
Fibonnaci Heap
Binary HeapPerfomance

Nonfunctional requirements

Use the following technologies:

Mock ups

Pacman

Maze generator

A "perfect" maze is a Minimum spanning tree, so whatever algorithm must work.