Application of A-Star Algorithm on Pathfinding Game

Pathfinding is the method for determining the shortest path. Pathfinding is widely used in various fields of Computer Science. One of them is game development. This research will design and analyze the pathfinding using the A-Star algorithm and implement it on a tree planting game. The Artificial In...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1898; no. 1; pp. 12047 - 12052
Main Authors Candra, Ade, Budiman, Mohammad Andri, Pohan, Rahmat Irfan
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.06.2021
Subjects
Algorithms
Artificial intelligence
Games
Nodes
Physics
Shortest-path problems
Tree planting
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/1898/1/012047

Cover

More Information
Summary:Pathfinding is the method for determining the shortest path. Pathfinding is widely used in various fields of Computer Science. One of them is game development. This research will design and analyze the pathfinding using the A-Star algorithm and implement it on a tree planting game. The Artificial Intelligence in the game will find its own shortest path from the start node to the goal node. The heuristic of A-Star is the Manhattan Distance that allows movement in four different directions. The result shows that the number of visited nodes will increase if the grid has many obstacle nodes, and the average time of the A-Star pathfinding process is 0.0732 seconds.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/1898/1/012047