Asymptotic properties of minimax trees and game-searching procedures
From MaRDI portal
Publication:1145506
DOI10.1016/0004-3702(80)90037-5zbMath0445.68048OpenAlexW2017359019WikidataQ56141856 ScholiaQ56141856MaRDI QIDQ1145506
Publication date: 1980
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(80)90037-5
Related Items
A generalization of alpha-beta and \(SSS^*\) search procedures, Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees, Eigen-distribution on random assignments for game trees, Asymptotic properties of level-regular decision trees with randomly evaluated leaves, Statistical heuristic search, Method of outer approximations and adaptive approximations for a class of matrix games, The eigen-distribution for multi-branching weighted trees on independent distributions, Best-first fixed-depth minimax algorithms, Independent-valued minimax: Pathological or beneficial?, Independent distributions on a multi-branching AND-OR tree of height 2, An investigation of the causes of pathology in games, Equilibrium points of an AND-OR tree: under constraints on probability, On game graph structure and its influence on pathology, A Stochastic Maximin Fixed-Point Equation Related to Game Tree Evaluation, 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, Minimax functions on Galton–Watson trees, A minimax algorithm better than alpha-beta? Yes and no, Pathology on game trees revisited, and an alternative to minimaxing, A comparison of minimax tree search algorithms, On the nature of pathology in game searching, The multi-player version of minimax displays game-tree pathology
Cites Work
