Animal Chess

Searching Algorithm Example

This repository stores my python solutions to programming challenges that I have found from various sources.

Developed a maze-solving script in Python, employing the breadth-first search (BFS) algorithm to determine the shortest path between two points within a maze. Implemented the project using the curses library for user interface and visualization.

Reads a .txt file of city-to-city flights and uses Breadth-First Search (BFS) to determine if a path exists between two locations. Highlights file I/O, graphs, and queue-based traversal.

Master's | Basic Algorithms & Data structures | Final Project