Abstract
Liu and Tanaka (2007) investigated the eigendistribution, which achieves the distributional complexity, for uniform binary trees. In the present work, we extend their studies to balanced multi-branching trees. We show that an eigen-distibution is equivalent to Ei-distribution with respect to the closed set of all alpha-beta pruning algorithms. The proof is quite different from the uniform binary case given by Suzuki and Nakamura (2012). We also show that for any multibranching tree, Ei-distribution is the unique eigen-distribution with respect to the set of all alpha-beta pruning algorithms.
Original language | English |
---|---|
Pages (from-to) | 318-325 |
Number of pages | 8 |
Journal | IAENG International Journal of Computer Science |
Volume | 43 |
Issue number | 3 |
Publication status | Published - 2016 |
Keywords
- AND-OR trees
- Alpha-beta pruning algorithms
- Balanced trees
- Randomized complexity
- Uniform trees
ASJC Scopus subject areas
- Computer Science(all)