Skip to content

A* or A Star algorithm implementation for A.I. class at FURB.

License

Notifications You must be signed in to change notification settings

HMLarsen/A-Star-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A-Star-Algorithm

A* or A Star algorithm implementation for A.I. class at FURB.

Authors

Eduardo Z. Feller
Hugo Marcel Larsen
Lucas Vanderlinde

Tests

Run AStarTest.java and select a input for create the algorithm area. The correct syntax of the text file is:

  • Line 1: quantity of rows and columns of the area separated by comma.
  • Line 2: row and column position of the initial node in the area separated by "-".
  • Line 3: row and column position of the final node in the area separated by "-".
  • Line 4+: row and column position of a block node in the area separated by "-".

Example inputs are in the "test inputs" folder. Test input 3 example:

Area (cost: 60):

   0  1  2  3  
0  -  -  -  -  
1  I  *  *  -  
2  -  B  *  -  
3  -  B  *  -  
4  -  B  *  -  
5  -  B  F  -  
6  -  -  -  - 

About

A* or A Star algorithm implementation for A.I. class at FURB.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages