An interactive Java application that visualizes the A* pathfinding algorithm in real-time
- Interactive Grid: Click to add/remove walls and obstacles
- Real-time Visualization: See the algorithm explore nodes step by step
- Cost Display: Each node shows its F-cost and G-cost values
- Simple Controls: Mouse clicks and keyboard shortcuts (check "Controls")
- Make sure you have Java 8 or higher installed
- Download or clone this repository
- Compile:
javac *.java - Run:
java Main
- Left Mouse Button: Add walls/obstacles
- Right Mouse Button: Remove walls
- Enter Key: Start the pathfinding algorithm
- Reset Button: Clear the grid and start over
| Color | Meaning |
|---|---|
| 🔵 Blue | Start Node |
| 🟡 Yellow | Goal Node |
| ⚫ Dark Gray | Wall/Obstacle |
| 🔵 Light Blue | Open Nodes (being considered) |
| 🟠 Orange | Checked Nodes (already evaluated) |
| 🟢 Green | Final Path |
- Language: Java
- GUI: Swing
- Algorithm: A* (using Manhattan distance as the heuristic function)
- Grid: 15x15 (customizable)
Built as an educational tool to help visualize how A* algorithm works.