Algorithms 2012, 5(4), 521-528; doi:10.3390/a5040521

Alpha-Beta Pruning and Althöfer’s Pathology-Free Negamax Algorithm

Received: 25 July 2012; in revised form: 6 October 2012 / Accepted: 25 October 2012 / Published: 5 November 2012
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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 decrease as the height of the tree increases. Althöfer’s alternative minimax algorithm has been proven to be invulnerable to pathology. However, it has not been clear whether alpha-beta pruning, a crucial component of practical game programs, could be applied in the context of Alhöfer’s algorithm. In this brief paper, we show how alpha-beta pruning can be adapted to Althöfer’s algorithm.
Keywords: game tree; search pathology; alpha-beta pruning
PDF Full-text Download PDF Full-Text [81 KB, uploaded 5 November 2012 08:39 CET]

Export to BibTeX |

MDPI and ACS Style

Abdelbar, A.M. Alpha-Beta Pruning and Althöfer’s Pathology-Free Negamax Algorithm. Algorithms 2012, 5, 521-528.

AMA Style

Abdelbar AM. Alpha-Beta Pruning and Althöfer’s Pathology-Free Negamax Algorithm. Algorithms. 2012; 5(4):521-528.

Chicago/Turabian Style

Abdelbar, Ashraf M. 2012. "Alpha-Beta Pruning and Althöfer’s Pathology-Free Negamax Algorithm." Algorithms 5, no. 4: 521-528.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert