I developed a 2D A* pathfinder application that leverages a multithreaded architecture. This design allows the application to perform efficiently by processing pathfinding operations while rendering. A distinctive feature of this app is its capability to visualize the A* algorithm in real time at a controlled speed. Users can observe the algorithm’s decision-making process in detail as it searches for the shortest path between two points on a grid.

This project deepened my skills across several technical areas. Implementing the A* algorithm gave me hands-on experience with graph theory as applied to 2D grids. I expanded my prior knowledge of multithreading, learning to manage multiple processes simultaneously to maintain smooth application performance. The project also pushed me to optimize code and algorithm performance, leading to faster response times and efficiency improvements.