Relative Efficiency of Alpha-Beta Implementations
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 763-765.
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.
@inproceedings{ijcai1983p184,
title = {Relative Efficiency of Alpha-Beta Implementations},
author = {Marsland, T. Anthony},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {763--765},
year = {1983},
note = {Planning and Search},
url = {https://ijcai.org/proceedings/1983/184},
}
TY - CPAPER TI - Relative Efficiency of Alpha-Beta Implementations AU - Marsland, T. Anthony T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 763 EP - 765 UR - https://ijcai.org/proceedings/1983/184 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
