The eigen-distribution for multi-branching weighted trees on independent distributions

DOI10.1007/S11009-021-09849-7OpenAlexW3127967176MaRDI QIDQ2671226

Kazuyuki Tanaka, Weiguang Peng, NingNing Peng

Publication date: 3 June 2022

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-021-09849-7

zbMATH Keywords

computational complexityalpha-beta pruning algorithmindependent distributiongame trees with weights

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Equilibrium points of an AND-OR tree: under constraints on probability
• Asymptotic properties of minimax trees and game-searching procedures
• An analysis of alpha-beta pruning
• The eigen-distribution of weighted game trees
• Non-depth-first search against independent distributions on an AND-OR tree
• Eigen-distribution on random assignments for game trees
• Finding optimal satisficing strategies for and-or trees
• Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees
• The Computational Complexity of Game Trees by Eigen-Distribution
• Optimal Search on Some Game Trees

This page was built for publication: The eigen-distribution for multi-branching weighted trees on independent distributions