Open AccessAPPLYING ALPHA-BETA ALGORITHM IN A CHESS ENGINE
Author(s) -
Werda Buana Putra,
Lukman Heryawan
Publication year - 2017
Publication title -
jurnal teknosains: jurnal ilmiah sains dan teknologi/jurnal teknosains : jurnal ilmiah sains dan teknologi
Language(s) - English
Resource type - Journals
eISSN - 2443-1311
pISSN - 2089-6131
DOI - 10.22146/teknosains.11380
Subject(s) - alpha (finance) , pruning , beta (programming language) , minimax , algorithm , computer science , tree (set theory) , search algorithm , mathematics , mathematical optimization , combinatorics , statistics , construct validity , agronomy , biology , programming language , psychometrics
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.