A minimax algorithm better than alpha-beta? Yes and No
- 31 March 1983
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 21 (1-2) , 199-220
- https://doi.org/10.1016/s0004-3702(83)80010-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A general branch and bound formulation for understanding and synthesizing and/or tree search proceduresArtificial Intelligence, 1983
- The solution for the branching factor of the alpha-beta pruning algorithm and its optimalityCommunications of the ACM, 1982
- Asymptotic properties of minimax trees and game-searching proceduresArtificial Intelligence, 1980
- A minimax algorithm better than alpha-beta?Artificial Intelligence, 1979
- On the branching factor of the alpha-beta pruning algorithmArtificial Intelligence, 1978
- An analysis of alpha-beta pruningArtificial Intelligence, 1975