Perbandingan Penerapan Algoritma A*, IDA*, Jump Point Search, dan PEA* P ada Permainan Pacman
Article Sidebar
Published:
Dec 10, 2016
Main Article Content
Abstract
Pathfinding is a way to find the shortest route between two points. There are several A* variant algorithms such as Iterative Deepening A* (IDA*) algorithm, Partial Expansion A* (PEA*), and Jump Point Search (JPS). In this research, the writer evaluates the performance of A*, IDA* algorithm, JPS, and PEA* algorithm. The algorithms are implemented in pacman game and the writer get the data by measuring visited nodes, and the route it takes. Based on the analysis of algorithms in a game, it concluded that the algorithms have the same path solution, but JPS algorithm has less visited nodes than A*, IDA*, and PEA*
Downloads
Download data is not yet available.
Article Details
How to Cite
[1]
R. Delima, G. T. Indrajaya, A. K. Takaredase, I. D. E.K.R., and A. R. C, “Perbandingan Penerapan Algoritma A*, IDA*, Jump Point Search, dan PEA* P ada Permainan Pacman”, JuTISI, vol. 2, no. 3, Dec. 2016.
Section
Articles
This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (https://creativecommons.org/licenses/by-nc/4.0/) which permits unrestricted non-commercial used, distribution and reproduction in any medium.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.