MINIMAX ALGORITHM BASED ON "MAIN INI YUK" GAME

Hawari, Sirajuddin and Maulana, Muhammad Zulfikri and Musyaffa, Teuku Binzar Nawaf and Komalasari, Desy and Pulungan, Mutiara Persada (2022) MINIMAX ALGORITHM BASED ON "MAIN INI YUK" GAME. JURNAL ILMIAH SISTEM INFORMASI DAN ILMU KOMPUTER (JUISIK), 2 (1). pp. 12-17. ISSN 2827-8135

Text 33. Minimax Algorithm based on Main ini yuk game.pdf Restricted to Registered users only Download (669kB)

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.

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User:	Fahru Abdhul Aziz
Date Deposited:	24 Jul 2023 08:24
Last Modified:	24 Jul 2023 08:24
URI:	http://repository.esqbs.ac.id/id/eprint/326

Actions (login required)

View Item