MINIMAX ALGORITHM BASED ON "MAIN INI YUK" GAME
DOI:
https://doi.org/10.55606/juisik.v2i1.318Keywords:
Game, Algorithm, Minimax, Analysis, Complexity.Abstract
In the game there are rules for each game. The rules are made as a challenge to achieve victory. To achieve victory requires analysis of the right algorithm in making decisions. Minimax is one of the best decision-making algorithms to be applied in a game. The time complexity of the minimax algorithm is O(b^m) which b is the branching and m is the depth.
References
GeeksforGeeks, “Minimax Algorithm in Game Theory | Set 1 (Introduction).” GeeksforGeeks.org, 24 11 2021. [Online]. Available: https://www.geeksforgeeks.org/minimax-algorithm-in-game-theory-set-1-introduction. [Accessed 27 12 2021].
GeeksforGeeks, “Minimax Algorithm in Game Theory | Set 3 (Tic-Tac-Toe AI - Finding Optimal move),” GeeksforGeeks.org, 19 10 2021. [Online]. Available: Minimax Algorithm in Game Theory | Set 3 (Tic-Tac-Toe AI - Finding optimal move) - GeeksforGeeks. [Accessed 27 12 2021].
JavaTPoint, “Mini-max Algorithm in Artificial Intelligence,” Javatpoint.com. [Online]. Available: Artificial Intelligence | Mini-Max Algorithm - Javatpoint. [Accessed 29 12 2021]
Sumali, Brian, Siregar, Ivan Michael, Rosalina. “Implementation of Minimax with Alpha-Beta Pruning as Computer Player in Congklak”. Jurnal Teknik Informatika dan Sistem Informasi, Volume 2 Nomor 2, Agustus 2016.
Videgaín, Santiago & Sánchez, Pablo García. “Performance Study of Minimax and Reinforcement Learning Agents Playing the Turn-based Game Iwoki”. Applied Artificial Intelligence, 35:10, 717-744, DOI: 10.1080/08839514.2021.1934265
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Jurnal ilmiah Sistem Informasi dan Ilmu Komputer
This work is licensed under a Creative Commons Attribution 4.0 International License.
