Goal
- Develop a pathfinding algorithm for a maze, simulating routing of signals in chip design.
- Implement a queue data structure.
- Utilize breadth-first search (BFS) for maze traversal.
- Read and manipulate maze images.
- Find the nearest exit in a maze.
- Output the solved maze with marked exit as a new image.
Takeaways
- Algorithm Design
- Image Manipulation
- Error Handling
- Testing and Debugging
- Queue Data Structures
Disclaimer
- Due to the Univeristy of Pittsburgh's academic integrity policy, I am unable to publicly
provide detailed information on
my design process, and final design of this project. If you are in need of any more
clarification you can contact me here.