Skip to content
#

serching-algorithms

Here are 9 public repositories matching this topic...

This project implements the A* Search Algorithm to find the shortest path in a randomly generated maze. Using the Manhattan Distance heuristic, the algorithm efficiently navigates through the maze and determines the optimal route from the start node to the goal node. The solution is visualized using the Pyamaze library, making the search process ea

  • Updated Jun 20, 2026

Improve this page

Add a description, image, and links to the serching-algorithms topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the serching-algorithms topic, visit your repo's landing page and select "manage topics."

Learn more