Low overhead alternatives to SSS∗
- 28 February 1987
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 31 (2) , 185-199
- https://doi.org/10.1016/0004-3702(87)90019-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Experiments in Search and KnowledgeICGA Journal, 1986
- An empirical comparison of pruning strategies in game treesIEEE Transactions on Systems, Man, and Cybernetics, 1985
- Parallel Branch-and-Bound Formulations for AND/OR Tree SearchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- A comparison of minimax tree search algorithmsArtificial Intelligence, 1983
- A minimax algorithm better than alpha-beta? Yes and NoArtificial Intelligence, 1983
- Parallel Search of Strongly Ordered Game TreesACM Computing Surveys, 1982
- Asymptotic properties of minimax trees and game-searching proceduresArtificial Intelligence, 1980
- A minimax algorithm better than alpha-beta?Artificial Intelligence, 1979
- An analysis of alpha-beta pruningArtificial Intelligence, 1975
- Experiments With Some Programs That Search Game TreesJournal of the ACM, 1969