This project implements two essential pathfinding algorithms used in artificial intelligence and graph traversal: A* (A-star) and Breadth-First Search (BFS). It is designed to help visualize and compare how these algorithms find paths from a start point to a goal within a grid-based environment.
python astar astar-algorithm pathfinding pygame bfs pathfinding-algorithm astar-pathfinding bfs-algorithm astar-search astar-search-algorithm bfs-search pathfinding-visualizer pathfinder-visualizer bfs-visualization
-
Updated
Jul 28, 2026 - Python