Back to Search
Start Over
APPLYING ALPHA-BETA ALGORITHM IN A CHESS ENGINE
- Source :
- Jurnal Teknosains: Jurnal Ilmiah Sains dan Teknologi, Vol 6, Iss 1, Pp 37-43 (2017), Jurnal Teknosains; Vol 6, No 1 (2016): December; 37-43
- Publication Year :
- 2017
- Publisher :
- Universitas Gadjah Mada, 2017.
-
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.
- Subjects :
- Negamax
Computer science
lcsh:T
Algorithm
Alpha-Beta Pruning
Chess engine
Minimax
Search Tree
Game Theory
Zero-Sum Game
Alpha–beta pruning
Iterative deepening depth-first search
lcsh:Technology
Search algorithm
Principal variation search
lcsh:Technology (General)
Null-move heuristic
Combinatorial search
lcsh:T1-995
lcsh:Q
lcsh:Science
lcsh:Science (General)
Killer heuristic
lcsh:Q1-390
Subjects
Details
- Language :
- English
- ISSN :
- 24431311 and 20896131
- Volume :
- 6
- Issue :
- 1
- Database :
- OpenAIRE
- Journal :
- Jurnal Teknosains: Jurnal Ilmiah Sains dan Teknologi
- Accession number :
- edsair.doi.dedup.....559eaf7cca166a5d94b2e6d006719859