https://github.com/rorro6787/a-algorithm
A* Algorithm Implementation
https://github.com/rorro6787/a-algorithm
Last synced: 6 months ago
JSON representation
A* Algorithm Implementation
- Host: GitHub
- URL: https://github.com/rorro6787/a-algorithm
- Owner: rorro6787
- Created: 2023-03-18T15:57:08.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2023-05-19T18:05:35.000Z (over 2 years ago)
- Last Synced: 2025-02-13T06:44:01.600Z (11 months ago)
- Language: Java
- Homepage:
- Size: 37.1 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# A*Algorithm
Small project where you can easily see and understant how the A*Algorithm would find the shortest path between two points in a grid with a fixed % of obstacles.
Further information: https://en.wikipedia.org/wiki/A*_search_algorithm
## Information
We have a Tablero class that has a String matrix with 60x80 dimensions. To begin with we choose a fixed % of obstacles like a 30%. Those obstacles will be represented with the * symbol. Furthermore, we have an start position represented with I and an ending position, represented with G and the goal is to implement a variant of the A* Algorithm to obtain the optimal path between these two points in the grid.
## GUI Functionality
I have updated the project and added a graphycal user interface for the user to visualize what the algorithm achieves in an easy and understandable way.
The user has to write in a label a porcentaje of obstacles between 10% and 90% and then press the "generate laberithm button":
After that, the only button enabled is the one that finds the shortest path (if there is) using the A* algorithm and prints it as you can see for instance:
## Technology Used
- Java
## Team
- Emilio Rodrigo Carreira Villalta