Project Overview
PathFinders started as a class project for comparing how search algorithms move through the same maze.
It generates solvable mazes with adjustable size and complexity, then shows each algorithm's search process and final path in a Pygame interface.
Technical Implementation
Implemented Algorithms
Breadth-First Search (BFS) - Optimal for unweighted paths
Depth-First Search (DFS) - Memory-efficient maze exploration
A* Search - Optimal pathfinding with heuristics
Bidirectional Search - Simultaneous path exploration
Simulated Annealing - Probabilistic path optimization
Dijkstra's Algorithm - Optimal weighted pathfinding
Technologies Used
Python
PyGame
Algorithm Design
Path Finding
GUI Development