Asymptotic properties of level-regular decision trees with randomly evaluated leaves
From MaRDI portal
Publication:1099794
DOI10.1007/BF01794430zbMath0638.90110MaRDI QIDQ1099794
Publication date: 1989
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
asymptotic propertiesevaluation functionsdecision-makinggame treeslevel-regular decision treesrandomly evaluated leaves
Cites Work
- Asymptotic properties of minimax trees and game-searching procedures
- The last player theorem
- An investigation of the causes of pathology in games
- An analysis of alpha-beta pruning
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- On the branching factor of the alpha-beta pruning algorithm
- A minimax algorithm better than alpha-beta? Yes and no
- Pathology on game trees revisited, and an alternative to minimaxing
- On the nature of pathology in game searching
This page was built for publication: Asymptotic properties of level-regular decision trees with randomly evaluated leaves