On the complexity of searching game trees and other recursion trees

DOI10.1016/0196-6774(88)90016-8zbMath0662.90040OpenAlexW2083830116MaRDI QIDQ3813591

Ingo Althöfer

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90016-8

zbMATH Keywords

artificial intelligencepruningdecision analysisbinary bi-valued game treesbranching factorsGame tree searchingRecursion treesSchrüfers s-tree model

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

The complexity of a simple stochastic OR-tree model in which ``directional search is bad ⋮ A game tree with distinct leaf values which is easy for the alpha-beta algorithm

This page was built for publication: On the complexity of searching game trees and other recursion trees