Minimax search algorithms with and without aspiration windows
Authors:
- H. KaindlHKH. Kaindl
- R. ShamsRSR. Shams
- H. HoracekHHH. Horacek
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 13 (12) , 1225-1235
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Tree Searching Algorithms1990
- Problemlösen durch heuristische Suche in der Artificial Intelligence1989
- Low overhead alternatives to SSS∗Artificial Intelligence, 1987
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- An empirical comparison of pruning strategies in game treesIEEE Transactions on Systems, Man, and Cybernetics, 1985
- A comparison of minimax tree search algorithmsArtificial Intelligence, 1983
- Parallel Search of Strongly Ordered Game TreesACM Computing Surveys, 1982
- Asymptotic properties of minimax trees and game-searching proceduresArtificial Intelligence, 1980
- Performance Analysis of the Technology Chess Program1978
- An analysis of alpha-beta pruningArtificial Intelligence, 1975