Equilibrium points of an AND-OR tree: under constraints on probability

DOI10.1016/j.apal.2015.07.002zbMath1335.68244arXiv1401.8175OpenAlexW1492148130MaRDI QIDQ490867

Toshio Suzuki, Yoshinao Niida

Publication date: 21 August 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.8175

zbMATH Keywords

computational complexityAND-OR treegame treeindependent identical distributionOR-AND tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees ⋮ The eigen-distribution for multi-branching weighted trees on independent distributions ⋮ Independent distributions on a multi-branching AND-OR tree of height 2 ⋮ Non-depth-first search against independent distributions on an AND-OR tree

Cites Work

• Unnamed Item
• Asymptotic properties of minimax trees and game-searching procedures
• An analysis of alpha-beta pruning
• On the branching factor of the alpha-beta pruning algorithm
• Eigen-distribution on random assignments for game trees
• Optimal Search on Some Game Trees
• The solution for the branching factor of the alpha-beta pruning algorithm and its optimality

This page was built for publication: Equilibrium points of an AND-OR tree: under constraints on probability