Time-efficient state space search
Authors:
- Alexander ReinefeldARAlexander Reinefeld
- Peter RidingerPRPeter Ridinger
- 1 December 1994
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 71 (2) , 397-408
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A faster alternative to SSS* with extension to variable memoryInformation Processing Letters, 1993
- Iterative broadeningArtificial Intelligence, 1992
- Minimax search algorithms with and without aspiration windowsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Searching minimax game trees under memory space constraintAnnals of Mathematics and Artificial Intelligence, 1990
- Low overhead alternatives to SSS∗Artificial Intelligence, 1987
- Generalization of alpha-beta and SSS∗ search proceduresArtificial Intelligence, 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 SearchIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- A minimax algorithm better than alpha-beta? Yes and NoArtificial Intelligence, 1983
- An analysis of alpha-beta pruningArtificial Intelligence, 1975