Aplikasi permainan congklak dengan menggunakan algoritma minimax & alphabeta pruning = Congklak game application using minimax and alphabeta pruning algorithm
Daftar Isi:
- 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. The result of the bowl value testing is 50,30,10; and the result of AI winning testing, which had been done by several people with 50 total played for each levels, is 46% for easy level, 60% for medium level, and 72% for hard level.