PERBANDINGAN METODE OPTIMASI ALGORITMA MINIMAX PADA PERMAINAN CATUR

Alfarabi Dwi Karuniawan, Aries Saifudin, Ari Irawan

Abstract


Permainan catur telah banyak dikembangkan pada media digital, namun permainan yang telah dihasilkan masih memiliki beberapa kekurangan, seperti lambatnya komputer menentukan pergerakan lanjutan, atau kurang tepatnya komputer memilih bidak dan pergerakannya saat bertanding melawan pengguna. Pada penelitian terdahulu tentang kecerdasan buatan, permainan catur dapat dibuat dengan menggunakan algoritma minimax, namun karena kompleksitas dari permainan catur yang mengakibatkan lambatnya proses saat komputer menghitung langkah dan mengambil keputusan pergerakan bagi bidak-bidak miliknya, beberapa metode seperti alpha-beta pruning, capturing heuristic, transposition tables, dan history heuristic telah dibuat untuk mengoptimasi kecepatan pencarian gerakan terbaik pada permainan catur yang memanfaatkan algoritma minimax sebagai dasar metode pencarian. Berdasarkan penerapan dan pengujian dalam penelitan ini, metode-metode tersebut dapat mengoptimasi kecepatan pencarian untuk mengetahui pergerakan terbaik yang sebelumnya hanya memanfaaatkan algoritma minimax.

 

Kata kunci: Catur, Permainan, pencarian, minimax, heuristis


Full Text:

PDF

References


A. M. Gatej, "Chess Cryptosystem," Journal of Mobile, Embedded and Distributed Systems, pp. 29-34, 2010.

F. Gobet and G. Campitelli, "Educational Benefits of Chess Instruction: A Critical Review," in In T. Redman (Ed.), Chess and Education: Selected essays from the Koltanowski conference, Dallas, 2006.

F. Gliga and P. I. Flesner, "Cognitive Benefits of Chess Training in Novice Children," Procedia - Social and Behavioral Sciences, vol. 116, pp. 962-967, 2014.

W. M. Bart, "On the Effect of Chess Training on Scholastic Achievement," Frontiers in Psychology, vol. 5, no. 762, pp. 1-3, 2014.

M. Scholz, H. Niesch, O. Steffen, B. Ernst, M. Loeffler, E. Witruk and H. Schwarz, "Impact of Chess Training on Mathematics Performance and Concentration Ability of Children with Learning Disabilities," International Journal of Special Education, vol. 23, no. 3, pp. 138-148, 2008.

Z. Halim, A. R. Baig and K. Zafar, "Evolutionary Search in the Space of Rules for Creation of New Two-Player Board Games," International Journal on Artificial Intelligence Tools, vol. 23, no. 2, pp. 1-26, 2014.

Suyanto, Artificial Intelligence, Bandung: Informatika Bandung, 2014.

O. E. David, H. J. v. d. Herik, M. Koppel and N. S. Netanyahu, "Genetic Algorithms for Evolving Computer Chess Programs," IEEE Transactions on Evolutionary Computation, vol. 18, no. 5, pp. 779 - 789, 2014.

C. E. Shannon, "Programming a Computer for Playing Chess," Philosopical Magazine, vol. 41, pp. 256-275, March 1950.

A. Weinstein, M. Littman and S. Goschin, "Rollout-based Game-tree Search Outprunes Traditional Alpha-beta," in 10th European Workshop on Reinforcement Learning, Edinburgh, 2012.

D. E. Knuth and R. W. More, "An Analysis of Alpha-Beta Prunning," Artificial Intelligence, vol. 6, pp. 293-326, 1975.

Y. Liu, H. Zang and P. Fu, "A Hybrid Game Tree Search Algorithm for Playing Chess," Journal Of Computational Information Systems, vol. 14, p. 5803–5811, 2012.

R. G. Ulma, M. Fusco and A. Mycroft, Java 8 in Action, Shelter Island: Manning Publication, 2014.

T. Sutojo, E. Mulyanto and V. Suhartono, Kecerdasan Buatan, Yogyakarta: Andi Yogyakarta, 2011.

S. J. Russel and P. Norvig, Artificial Intelligence a Modern Approach, New Jersey: Prentice Hall, 1995.

G. Weis, A Modern Approach to Distributed Artificial Intelligence, London: The MIT Press, 1999.

B. Robertie, I. Horowitz and H. Kidders, Cara Cepat dan Mahir Bermain Catur, 1 ed., Semarang: Dahara Prize, 2014.

R. Bott and M. Stanley, Discovering Chess, London: Faber And Faber, 1975.

J. R. Capablanca, Chess Fundamentals, New York: Harcourt, Brace & World Inc, 1934.

E. B. Purwanto, Perancangan dan Analisis Algoritma, Yogyakarta: Graha Ilmu, 2008.

A. Taherkhani, L. Malmi and A. Korhonen, "Using Roles of Variables in Algorithm Recognition," in International Conference on Computing Education Research, Uppsala, 2009.

B. Carlstrom, J. W. Chung, H. Chafi, A. McDonald, C. C. Minh, L. H. C. Kozyrakis and K. Olukotin, "Executing Java Program with Transactional Memory," Science of Computer Programming, pp. 111-129, 2005.




DOI: http://dx.doi.org/10.30813/j-alu.v1i2.1371

Refbacks

  • There are currently no refbacks.


p-ISSN 2620-620X
e-ISSN 2621-9840

 

Indexed By

  

Recomended Tools: