Article Per Year (5 Year)
p-Index From 2021 - 2026
1.817
P-Index
This Author published in this journals
All Journal SALAM: Jurnal Sosial dan Budaya Syar-i Jurnal Teknologi Informasi dan Ilmu Komputer Jurnal Teknologi dan Sistem Komputer JURNAL INTEGRASI Jurnal Mantik Penusa International Journal of Technology And Business Justek : Jurnal Sains Dan Teknologi Jurnal Sisfokom (Sistem Informasi dan Komputer) SISFO IJISTECH (International Journal Of Information System & Technology) Kilat Kurawal - Jurnal Teknologi, Informasi dan Industri JISA (Jurnal Informatika dan Sains) Jurnal Sistem Informasi dan Sains Teknologi IJISTECH RESOLUSI : REKAYASA TEKNIK INFORMATIKA DAN INFORMASI International Journal of Advanced Science Computing and Engineering Prosiding Seminar Nasional Universitas Ma Chung Jurnal INFOTEL GEMBIRA (Pengabdian Kepada Masyarakat)
Silvester Dian Handy Permana, Silvester Dian Handy
Department Of Informatics, Universitas Trilogi
Religion Humanities Automotive Engineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Energy Engineering Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Public Health Social Sciences Other

Published : 35 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : IJISTECH

 1 
Implementation of Min Max Algorithm as Intelligent Agent on Card Battle Game Silvester Dian Handy Permana
IJISTECH (International Journal of Information System and Technology) Vol 2, No 2 (2019): May
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v2i2.20

Abstract

Information technology brings transformation from the physical world into the digital world. This transformation developed in various fields, especially games. In the past, games that are involving physical objects such as chess, cards, dominoes, and mahjong are popular for the publics. Card battle game is a game that pits strength between 2 cards. The game must have 2 players who will compete. However, if a player wants to practice before the match or wants to play alone, he needs Non Player Character (NPC). The NPC will be the opponent in card battle games. In order for NPCs to be able to fight players, a special algorithm is needed to make the NPCs compete with players. The algorithm that can be implemented into the NPC is the Min Max Algorithm. This algorithm is a responsive algorithm which can count every step of the player. The results of this study are expected to provide suitable opponents for players who want to practice or compete in Card Battle Game on their own.
Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game Silvester Dian Handy Permana; Ketut Bayu Yogha Bintoro; Budi Arifitama; Ade Syahputra
IJISTECH (International Journal of Information System and Technology) Vol 1, No 2 (2018): May
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v1i2.7

Abstract

Maze Runner game is a game that requires pathfinding algorithm to get to the destination with the shortest path. This algorithm is used in an NPC that will move from start node to destination node. However, the use of incorrect algorithms can affect the length of the computing process to find the shortest path. The longer the computing process, the longer the players have to wait. This study compared pathfinding algorithms A *, Dijkstra, and Breadth First Search (BFS) in the Maze Runner game. Comparison process of these algorithms was conducted by replacing the algorithm in the game by measuring the process time, the length of the path, and the numbers of block played in the existing computing process. The results of this study recommend which algorithm is suitable to be applied in Maze Runner Game.
Co-Authors Abdillah, Zihan Noor Ade Syahputra Adrian, Aldo Alda Larasati Anindya Arifitama, Budi Faisal . Faisal Piliang Fariz Allawi Ghozali Gede Andika Loka Graha Virgian Gustira Putri Hanan, Ghali Ketut Bayu Yoga Bintoro Ketut Bayu Yogha Bintoro Marini, Ghaisani Nurisa Maya Cendana, Maya Muhammad Naufal, Muhammad Nathanael Aldo Phillip Nugrahayati, Putri Rachmat Hakim Sutarto Ridwan Mulya Ridwan Mulya Sania Smith Yaddarabullah Yaddarabullah, - Yodfiatfinda, Yodfiatfinda