The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
From MaRDI portal
Publication:1238628
DOI10.1016/0004-3702(77)90017-0zbMath0359.68043OpenAlexW2053566010MaRDI QIDQ1238628
Publication date: 1977
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(77)90017-0
Related Items
A generalization of alpha-beta and \(SSS^*\) search procedures, Asymptotic properties of level-regular decision trees with randomly evaluated leaves, Best-first minimax search, Benefits of using multivalued functions for minimaxing, A minimax algorithm better than alpha-beta?, An investigation of the causes of pathology in games, Is real-valued minimax pathological?, On the branching factor of the alpha-beta pruning algorithm, Pathology on game trees revisited, and an alternative to minimaxing, A comparison of minimax tree search algorithms, The *-minimax search procedure for trees containing chance nodes, Strategies anticipating a difference in search depth using opponent-model search, A quantitative analysis of the alpha-beta pruning algorithm, Probabilistic opponent-model search, Special issue: Heuristic search and computer game playing
Cites Work
