MINIMAX ALGORITHM BASED ON "MAIN INI YUK" GAME

Sirajuddin Hawari (STIMIK ESQ Jakarta)
Muhammad Zulfikri Maulanab (STIMIK ESQ Jakarta)
Teuku Binzar Nawaf Musyaffa (STIMIK ESQ Jakarta)
Desy Komalasari (STIMIK ESQ Jakarta)
Mutiara Persada Pulungan (STIMIK ESQ Jakarta)

Jurnal Ilmiah Sistem Informasi dan Ilmu Komputer
Vol. 2 No. 1 (2022): Maret : Jurnal ilmiah Sistem Informasi dan Ilmu Komputer

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.