Penerapan Algoritma Negamax dan Alpha Beta Pruning pada Permainan Othello

  • William William STMIK GI MDP
  • Regiza Giovanno STMIK GI MDP
  • Daniel Udjulawa STMIK GI MDP
Keywords: Othello, Algoritma Negamax, Algoritma Alpha Beta Pruning, Phonegap

Abstract

The game becoming a means of entertainment for leisure time for many people. One of them is the game Othello is a classic board game. The purpose of this study was to apply the algorithm Negamax and Alpha Beta Pruning Algorithms in Othello game as opposed to a player, as well as the extent of the time required by the opponent using that algorithm. With both of these algorithms cleverness in taking strategy by the computer in the game can be calculated with the grace period currently provides solutions against the player. This game was made using Phonegap framework. Artificial intelligence will be visible when the algorithm used for the process. Identification workflow of Algorithms Negamax and Alpha Beta Pruning provides overview of the time required by the computer to interact with the players. System development using prototyping methods. Results of testing the application of the algorithm Negamax and Algorithms Alpha Beta Pruning in the game "Othello" is proven to help speed up the algorithm Negamax.

References

[1] Chandra, Yunita, Sabloak, Simmi & Angreni, Renni 2014, Penerapan Algoritma Minimax dan Breadth First Search pada Permainan Othello Menggunakan
Framework Phonegap, Sekolah Tinggi Manajemen Informatika dan Komputer Global Informatika Multi Data Palembang, Palembang.
[2] Stephanus, Hermawan S. 2011, Mudah Membuat Aplikasi Android, Andi Yogyakarta, Yogyakarta
[3] Sidik, Betha & Pohan, Iskandar Husni 2012, Pemrograman Web dengan HTML, Informatika, Bandung
[4] Sidik, Betha 2011, Java Script, Informatika, Bandung
Published
2016-03-14