Alpha-beta pruning and Althöfer's pathology-free negamax algorithm

Author's Department

Computer Science & Engineering Department

Find in your Library

https://doi.org/10.3390/a5040521

Document Type

Research Article

Publication Title

Algorithms

Publication Date

12-1-2012

doi

10.3390/a5040521

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. © 2012 by the author.

First Page

521

Last Page

528

This document is currently not available here.

Find this item online

Share

COinS