Maze Solving Algorithms
Unity, C#
About this project
Developed and visualised a range of maze-solving algorithms using Unity and C#. This project was driven by an interest in revisiting core algorithmic concepts while building an interactive visualisation tool.
Implemented approaches include: Left/Right Hand Rule, Pledge, A*, BFS (Lee’s), DFS (including bidirectional), Trémaux, dead-end filling, random search, and Soukup’s algorithm.