APPLYING ALPHA-BETA ALGORITHM IN A CHESS ENGINE
Werda Buana Putra(1*), Lukman Heryawan(2)
(1) Computer Science Department , Universitas Gadjah Mada
(2) Computer Science Department , Universitas Gadjah Mada
(*) Corresponding Author
Abstract
Minimax Algorithm, is a solution to reduce the burden on hardware in chess engine. However, a more in-depth method is needed to further increase the search algorithm. One of those solutions is called Alpha-Beta Pruning algorithm. The idea is to eliminate the unnecessary nodes in the search tree.
Keywords
Full Text:
PDFReferences
Abdelbar, A.M., 2005, Alpha-Beta Pruning and Alth¨ofer’s Pathology-Free Negamax Algorithm, ICCA.
Dechter, R., 2010, Rapier: A Chess Engine.
Elo, A. E., Sloan, S., 2008, The Rating of Chess Players, Past and Present Paperback.
Eppstein, D., 1999, Finding the k shortest paths, Dept. Information & Computer Science, UC Irvine,
Festa, J., Davino, S., 2013, “IAgo Vs Othello”: An artificial intelligence agent playing Reversi. ceur-ws.org/Vol-1107, diakses 10 November 2014.
John, F.N. , 1950 Equilibrium Points in n-Person Games. Proc. Natl. Acad. Sci. USA .
Lin, Y. C. 2014, The Hierarchical Minimax Theorems, http://journal.taiwanmathsoc.org.tw, diakses 10 November 2014.
Raghavan, T.E.S., 1994, Handbook of Game Theory, Elsevier Science B.V., , 738.
Reinefield, A., 1983, An Improvement to The Scout Search Tree Algorithm, ICCA Journal.
DOI: https://doi.org/10.22146/teknosains.11380
Article Metrics
Abstract views : 4676 | views : 3792Refbacks
- There are currently no refbacks.
Copyright (c) 2017 Werda Buana Putra, Lukman Heryawan
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Copyright © 2024 Jurnal Teknosains Submit an Article Tracking Your Submission
Editorial Policies Publishing System Copyright Notice Site Map Journal History Visitor Statistics Abstracting & Indexing