PERBANDINGAN ALGORITMA MINIMAX DAN NEGASCOUT PADA PERMAINAN CATUR SEDERHANA
DOI:
https://doi.org/10.30872/jim.v8i2.193Keywords:
Negascout, Minimax, Searching, Game Playing,Abstract
Simple Chess is a board game played by two players using boards sized in 3 rows and 3 columns and each player has pawns with different colors (normally black and white). The player wins if he/she can arrange the pawns in one line (diagonal, vertical or horizontal). The writer makes the comparisons of negascout algorithm and minimax algorithm in the application of Simple Chess to maximize the more suitable algorithm and implement them on the pawn placements in the shortest time. This research applies experimental method in form of literature study. The aspects of this research cover required features such as interface, input validation and output design. The result of this design is the application of Simple Chess embedded in negasc out algorithm and minimax algorithm. The tests used by White Box are Input, Output, program functions, and the speed of negascout algorithm and minimax algorithm in the pawn placements in Simple Chess. After being tested, the result shows that each algorithm has its own advantages and disadvantages, in which tests are done through pawn placements with the fastest time. After the comparison tests are finished, the writer concludes that in this research, minimax algorithm has a better pawn movement time in placements, whereas negascout algorithm has a better step decision.
References
Russell, Stuart J.; Norvig, Peter, 2003. Artificial Intelligence: A Modern Approach (2nd ed.), Upper Saddle River, New Jersey: Prentice Hall, pp. 163–171, ISBN 0-13-790395-2
Mandziuk, 2010. Knowledge-Free and Learning-Based Methods in Intelligent
Game Playing. Computational Intelligence 276 : Springer, (diakses 19 Mei 2012).
Effendi, Aditya Kurniawan., Delima, Rosa., Antonius R. C., 2012. Implementasi Algoritma Negascout Untuk Permainan Checkers, Informatika Jurnal Tekhnologi Komputer dan Informatika, Vol.8, No. 1, April 2012
Kusumadewi, Sri, 2003. Artificial Intelligence, Graha Ilmu, Yogyakarta.
Gilbert, E. N., 1985. An optimal minimax algorithm, Annals of Operations Research, Volume 4, Issue 1, pp 103-121
Sommerville, Ian., 2012. Software Engineering.9th edition, Pearson, United
State.
Perry, William E., 2006. Effective Methods For Software Testing, Edisi Ketiga, Wiley, Canada.
Plaat, Aske., Schaeffer, Jonathan., Pijls, Wim., Bruin, Arie de., 1995. An Algorithm Faster than NegaScout and SSS* in Practice, Computer Strategy Game Programming Workshop.
Gunawan, Kristian, Andika, Game playing untuk Othello dengan menggunakan
algoritma negascout dan MTDF (SNATI 2009), http://journal.uii.ac.id/index.php/Snati/article/viewFile/1278/1088, (diakses 19 Mei 2012).
Hasibuan, Zainal A. 2007. Metodologi Penelitian Pada Bidang Ilmu Komputer
Dan Teknologi Informasi, Konsep: Metode Teknik dan Aplikasi, Depok.
Downloads
Published
Issue
Section
License
Copyright Transfer StatementThe copyright of this article is transferred to Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer and when the article is accepted for publication. the authors transfer all and all rights into and to paper including but not limited to all copyrights in the Informatika Mulawarman. The author represents and warrants that the original is the original and that he/she is the author of this paper unless the material is clearly identified as the original source, with notification of the permission of the copyright owner if necessary. The author states that he has the authority and authority to make and carry out this task.
The author states that:
- This paper has not been published in the same form elsewhere.
- This will not be submitted elsewhere for publication prior to acceptance/rejection by this Journal.
A Copyright permission is obtained for material published elsewhere and who require permission for this reproduction. Furthermore, I / We hereby transfer the unlimited publication rights of the above paper to Informatika Mulawarman : Jurnal Ilmiah Ilmu Komputer. Copyright transfer includes exclusive rights to reproduce and distribute articles, including reprints, translations, photographic reproductions, microforms, electronic forms (offline, online), or other similar reproductions.
The author's mark is appropriate for and accepts responsibility for releasing this material on behalf of any and all coauthor. This Agreement shall be signed by at least one author who has obtained the consent of the co-author (s) if applicable. After the submission of this agreement is signed by the author concerned, the amendment of the author or in the order of the author listed shall not be accepted.
Rights / Terms and Conditions Saved
- The author keeps all proprietary rights in every process, procedure, or article creation described in Work.
- The author may reproduce or permit others to reproduce the work or derivative works for the author's personal use or for the use of the company, provided that the source and the Informatika Mulawarman copyright notice are indicated, the copy is not used in any way implying the Journal of Informatika Mulawarman (JIM) approval of the product or service from any company, and the copy itself is not offered for sale.
- Although authors are permitted to reuse all or part of the Works in other works, this does not include granting third-party requests to reprint, republish, or other types of reuse.
Informatika Mulawarman by http://e-journals.unmul.ac.id/index.php/JIM/index is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
under the CC BY-SA license, authors and other users are able to reprint, distribute or use the material for commercial purposes so long as they give attribution to the journal Informatika Mulawarman and license the republished material under the same license.
