Skip to content

Repository files navigation

🚀 A-Star Pathfinding Visualizer in React

This project is an interactive A (A-star) pathfinding algorithm visualizer* built with React.js. The A* algorithm is a powerful graph traversal and search algorithm used in game development, robotics, and AI to find the shortest path between two points.

✨ Features

  • ✅ Real-time visualization of the A* algorithm in action
  • ✅ Interactive grid: Set start, end, and obstacles dynamically
  • ✅ Fast and efficient pathfinding using heuristics
  • ✅ Customizable settings (grid size, speed, heuristic functions)
  • ✅ Intuitive UI with smooth animations

🎯 Why A*?

A* combines the benefits of Dijkstra's algorithm and Greedy Best-First Search, making it both optimal and efficient. It prioritizes paths with the lowest cost, ensuring an intelligent route to the destination.

📦 Tech Stack

🔹 React.js – UI framework for rendering components 🔹 HTML & CSS – Custom styling for a clean layout 🔹 JavaScript – Algorithm implementation and logic

🚀 Try It Out

Clone the repo, install dependencies, and run the app:

git clone https://github.com/imamtashbir95/a-star-maze.git
cd a-star-maze
npm install
npm run dev

🌟 Contribute

Got ideas for improvements? Feel free to fork, contribute, or open an issue! 🚀

About

This project is an interactive A (A-star) pathfinding algorithm visualizer* built with React.js. The A* algorithm is a powerful graph traversal and search algorithm used in game development, robotics, and AI to find the shortest path between two points.

Topics

Resources

Stars

Watchers

Forks

Releases

Used by

Contributors

Languages