Best-first fixed-depth minimax algorithms
Authors:
- Aske PlaatAPAske Plaat
- Jonathan SchaefferJSJonathan Schaeffer
- Wim PijlsWPWim Pijls
- Arie de BruinABArie de Bruin
- 1 November 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 87 (1-2) , 255-293
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Time-efficient state space searchArtificial Intelligence, 1994
- Proof-number searchArtificial Intelligence, 1994
- A world championship caliber checkers programArtificial Intelligence, 1992
- Conspiracy numbersArtificial Intelligence, 1990
- Generalization of alpha-beta and SSS∗ search proceduresArtificial Intelligence, 1986
- 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
- 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