The *-minimax search procedure for trees containing chance nodes
- 30 September 1983
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 21 (3) , 327-350
- https://doi.org/10.1016/s0004-3702(83)80015-0
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Backgammon computer program beats world championArtificial Intelligence, 1980
- Computer BackgammonScientific American, 1980
- 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