Optimal Search on Some Game Trees
From MaRDI portal
Publication:3765270
DOI10.1145/2402.322383zbMath0628.68072OpenAlexW1987842530MaRDI QIDQ3765270
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2402.322383
2-person games (91A05) Artificial intelligence (68T99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
Uniqueness of optimal randomized algorithms for balanced AND-OR trees ⋮ Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees ⋮ Eigen-distribution on random assignments for game trees ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ The eigen-distribution for multi-branching weighted trees on independent distributions ⋮ Bounded branching process and and/or tree evaluation ⋮ Independent distributions on a multi-branching AND-OR tree of height 2 ⋮ The complexity of a simple stochastic OR-tree model in which ``directional search is bad ⋮ A randomized competitive algorithm for evaluating priced AND/OR trees ⋮ Finding optimal satisficing strategies for and-or trees ⋮ Equilibrium points of an AND-OR tree: under constraints on probability ⋮ Randomized vs. deterministic decision tree complexity for read-once Boolean functions ⋮ Non-depth-first search against independent distributions on an AND-OR tree ⋮ On Monte-Carlo tree search for deterministic games with alternate moves and complete information ⋮ Average probe complexity in quorum systems
This page was built for publication: Optimal Search on Some Game Trees
