Relative efficiency of alpha-beta implementations

Authors:
T. A. Marsland
Affiliations:
Computing Science Department, University of Alberta, Canada
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 4
Cited 4

Experiments With Some Programs That Search Game Trees

Journal of the ACM (JACM)
Parallel Search of Strongly Ordered Game Trees

ACM Computing Surveys (CSUR)
The principal continuation and the killer heuristic

ACM '77 Proceedings of the 1977 annual conference
Analysis of speedup in distributed algorithms

Analysis of speedup in distributed algorithms

Transposition Table Driven Work Scheduling in Distributed Game-Tree Search

AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
A Speculative Strategy

CG '98 Proceedings of the First International Conference on Computers and Games
AWT: Aspiration with Timer Search Algorithm in Siguo

CG '08 Proceedings of the 6th international conference on Computers and Games
Enhanced forward pruning

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the data on the relative efficiency of different implementations of the alpha-beta algorithm is neither readily available nor in a form suitable for easy comparisons. In the present study four enhancements to the alpha-beta algorithm--iterative deepening, aspiration search, memory tables and principal variation search--are compared separately and in various combinations to determine the most effective alpha-beta implementation. The rationale for this work is to ensure that new parallel algorithms incorporate the best sequential techniques. Rather than relying on simulation or searches of specially constructed trees, a simple chess program was used to provide a uniform basis for comparisons.