Aplikasi game komputer banyak digunakan oleh masyarakat. Beberapa game memerlukan orang lain untuk dapat dimainkan. Seperti pada jenis board game yang dimainkan oleh dua pemain, maka dibutuhkan metode untuk membuat pemain dapat merasa game dimainkan oleh dua pemain. Dalam paper ini, peneliti akan mengimplementasikan algoritma minimax dalam sebuah permainan catur mini dimana tiap pemain memiliki 7 bidak. Algoritma minimax umumnya menghitung semua kemungkinan yang ada di game, kadang-kadang sampai game selesai.
|Published (Last):||21 January 2004|
|PDF File Size:||17.96 Mb|
|ePub File Size:||8.32 Mb|
|Price:||Free* [*Free Regsitration Required]|
Bachelor thesis, Universitas Pelita Harapan. Congklak is one of popular traditional games in Indonesia, but as technology keeps improving, traditional games are being forgotten. Therefore, congklak needs improvement. One of attempts is by creating a congklak game application. One advantage of this application is the attractive design. Another advantage is it can be played alone although congklak needs opponent. In this case, the existence of opponent is replaced by Artificial Intelligence AI.
Computer, with help from AI, can solve many difficult problems, so it looks clever. AI can be applied by using many algorithms, but this application uses Minimax and Alpha-Beta Pruning algorithms.
Minimax algorithm chooses path that cause minimum lost MIN and maximum benefit MAX for computer, while Alpha-Beta Pruning is used to speed up the choosing process time by cutting path s that assumed worse than the previous path.
This application made by using Java programming language. There are two kinds of testing that has been done to this application: testing the bowl value -used to search the best bowl value to make the best AI- and testing the percentage of AI winning. Download kB Abstract Congklak is one of popular traditional games in Indonesia, but as technology keeps improving, traditional games are being forgotten.
More information and software credits. Download kB. Download 1MB. Computer science. Mr Samuel Noya.
ALGORITMA MINIMAX PDF
Vamsi Sangam Hello people! In this post we will look at one of the most basic Artificial Intelligence algorithm, the MiniMax algorithm. MiniMax algorithm is used to implement basic AI or game logic in 2 player games. The most common scenario is implementing a perfect Tic-Tac-Toe player. So, in this article we will look at how to implement it.
Perbandingan Performa Algoritma Minimax dan Breadth First Search Pada Permainan Tic-Tac-Toe
Bachelor thesis, Universitas Pelita Harapan. One of the famous card game in Indonesia is Domino. This game is usually played by two person or more, maximum 4 person. The basic rules of domino are simple.