Pathology on game trees revisited, and an alternative to minimaxing
- 1 March 1983
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 21 (1-2) , 221-244
- https://doi.org/10.1016/s0004-3702(83)80011-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Decision Quality As a Function of Search Depth on Game TreesJournal of the ACM, 1983
- An investigation of the causes of pathology in gamesArtificial Intelligence, 1982
- The last player theoremArtificial Intelligence, 1982
- Asymptotic properties of minimax trees and game-searching proceduresArtificial Intelligence, 1980
- A minimax algorithm better than alpha-beta?Artificial Intelligence, 1979
- Tournament Competition Fuels Computer ChessScience, 1979
- The B∗ tree search algorithm: A best-first proof procedureArtificial Intelligence, 1979
- On the branching factor of the alpha-beta pruning algorithmArtificial Intelligence, 1978
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scoresArtificial Intelligence, 1977
- An analysis of alpha-beta pruningArtificial Intelligence, 1975