Next Article in Journal
Finite Element Quadrature of Regularized Discontinuous and Singular Level Set Functions in 3D Problems
Previous Article in Journal
Extracting Hierarchies from Data Clusters for Better Classification
Article Menu

Export Article

Open AccessArticle

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

Department of Computer Science & Engineering, American University in Cairo, Cairo, Egypt
Algorithms 2012, 5(4), 521-528;
Received: 25 July 2012 / Revised: 6 October 2012 / Accepted: 25 October 2012 / Published: 5 November 2012
PDF [81 KB, uploaded 5 November 2012]


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. View Full-Text
Keywords: game tree; search pathology; alpha-beta pruning game tree; search pathology; alpha-beta pruning

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

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

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top