Alpha-Beta Pruning and Althöfer’s Pathology-Free Negamax Algorithm
The minimax algorithm, also called the negamax algorithm, remains today the most widely used search technique for two-player perfect-information games. However, minimaxing has been shown to be susceptible to game tree pathology, a paradoxical situation in which the accuracy of the search can decreas...
Main Author: | Ashraf M. Abdelbar |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2012-11-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/5/4/521 |
Similar Items
-
Design of Checkers Game Using Alpha-Beta Pruning Algorithm
by: Achmad Naufal Wijaya Jofanda, et al.
Published: (2021-08-01) -
Analisis Efisiensi Algoritma Alpha Beta Pruning dan MTD(f) pada Connect4
by: Lukas Tommy, et al.
Published: (2016-10-01) -
A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms
by: Uroš Čibej, et al.
Published: (2019-10-01) -
Median quartet tree search algorithms using optimal subtree prune and regraft
by: Shayesteh Arasti, et al.
Published: (2024-03-01) -
Skeleton extraction and pruning point identification of jujube tree for dormant pruning using space colonization algorithm
by: Yuxing Fu, et al.
Published: (2023-01-01)