Penerapan Algoritma Alphabeta Pruning Sebagai Kecerdasan Buatan pada Game Pawn Battle

Article Sidebar

View PDF
Published May 11, 2017
DOI https://doi.org/10.20895/infotel.v9i2.166

Main Article Content

Ridho Rahman Hariadi
Institut Teknologi Sepuluh Nopember Surabaya
Imam Kuswardayan
Institut Teknologi Sepuluh Nopember Surabaya
Isye Arieshanti
Institut Teknologi Sepuluh Nopember Surabaya
Irooyan Alfi T.Z
Institut Teknologi Sepuluh Nopember Surabaya

Abstract

Catur merupakan game strategi. Catur dimainkan oleh dua orang. Ada dua jenis warna bidak pada permainan catur, yaitu: bidak hitam dan bidak putih. Agar dapat memenangkan sebuah permainan catur, pemain harus menguasai strategi-strategi dalam bermain catur. Ada banyak startegi dalam bermain catur yang hanya dapat dipahami dengan banyak bermain dan berlatih. Modul-modul cara bermain catur pada umumnya hanya menjelaskan kejadian yang biasa terjadi dalam permainan catur. Sehingga berlatih merupakan satu-satu nya cara yang dapat digunakan untuk meningkatkan kemampuan dalam bermain catur. Penelitian ini merupakan penelitian implementasi yang menggunakan algoritma Alpha Beta Prunnning sebagai kecerdasan buatan dalam permainan catur. Algoritma yang biasanya digunakan dalam permainan catur adalah algoritma Min-Max. Algoritma Min-Max merupakan algoritma yang digunakan untuk menemukan langkah terbaik dalam permainan catur. Sedangkan Algoritma Alpha Beta Pruning adalah algoritma yang digunakan untuk mencegah perluasan cabang/node untuk mendapatkan hasil pencarian langkah yang lebih baik dari sebelumnya. Penelitian ini diharapkan dapat membantu memberikan gambaran penerapan algoritma Alpha Beta Prunning yang digunakan dalam  membangun sebuah kecerdasan buatan pada permainan catur.

Downloads

Download data is not yet available.

Article Details

How to Cite
[1]
R. Hariadi, I. Kuswardayan, I. Arieshanti, and I. Alfi T.Z, “Penerapan Algoritma Alphabeta Pruning Sebagai Kecerdasan Buatan pada Game Pawn Battle”, INFOTEL, vol. 9, no. 2, pp. 185-192, May 2017.
Issue
Vol 9 No 2 (2017): May 2017
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work 

References

[1] U. Technologies, "Unity - unity - overview," Unity, 2015.
[Online]. Available: http://www.unity3d.com/unity. Accessed: Jun. 2, 2015.
[2] B. Foundation, "About," blender.org, 2015.
[Online]. Available: http://www.blender.org/about. Accessed: Jul. 2, 2016.
[3] "Methods - usability testing," 2002.
[Online]. Available: http://www.usabilityfirst.com/usability-methods/usability-testing/. Accessed: Jan. 23, 2016.
[4] "Pawn Battle Strategies," in Kenil Worth Chess Club.
[Online]. Available: http://www.kenilworthchessclub.org/media/Pawn_Battle_Strategies.pdf. Accessed: Jun. 23, 2015.
[5] S. J. Russell and P. Norvig, Artificial intelligence: A modern approach ;
[the intelligent agent book], 2nd ed. United States: Prentice Hall/Pearson Education, 2010.
[6] Blender Foundation, "Blender Supported Platforms". 26 April 2015.
[Online]. Available:http://wiki.blender.org/index.php/Dev:Ref/Supported_platforms.
[Accessed 3 June 2015]
[7] "Currently known best algorithm(s) for computer chess?," 2010.
[Online]. Available: http://stackoverflow.com/questions/2026262/currently-known-best-algorithms-for-computer-chess. Accessed: Jun. 3, 2015.
[8] Ilham, Anwari 2008, Penerapan Algoritma Minimax dengan Optimasi MTD(f) pada Permainan Catur, Jurnal, ITB, Bandung.
[9] Wikipedia, "Wikipedia Minimax", 4 April 2015.
[Online]. Available: https://en.wikipedia.org/wiki/Minimax.
[Accessed 3 June 2015]
[10] Hermawan L, Bendi RK. Penerapan Algoritma A* Pada Aplikasi Puzzle. Information Technology. 2013;4:23.
[11] Panggabean, I. B. T., Suryadharma, Y., & Nugroho, P. (2006). Penyelesaian Permasalahan 8 Puzzle dengan Menggunakan Algoritma A*(A Star). Dalam Makalah Mahasiswa Tahun, 2005-2006.
[12] Fahrurrozi, Implementasi Algoritma Iterative Deepening A8 dan metode Pruning Pada Solusi Permainan Puzzle Flow Free Color, 2010
[13] D.E Knuth, R.W. Moore, An Analysis of Alpha Beta Pruning, Artificial Intelligence, Vol6(4), 1975, pp. 293-326
[14] J. Schaeffer, A.Plaat, New Advances in Alpha Beta Searching
[15] C. Browne, D. Powley, D. Whitehouse, S. Lucas, P. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothariks, C. Colton, A Survey of Monte Carlo Tree Search Methods, IEEE Trans. Comput. Intell. AI Games, Vol(1), 2012, pp. 1-49
[16] R. Coulom, Efficient Selectivity and Backup Operators in Monte Carlo Tree Search, Computer and Games, 5th International Conference, CG 2006, Italy, Turin, Italy, May 29-31, pp. 72-83