A game tree with distinct leaf values which is easy for the alpha-beta algorithm

DOI10.1016/0004-3702(91)90042-IzbMath0755.90108MaRDI QIDQ1190799

Ingo Althöfer, Bernhard Balkenhol

Publication date: 26 September 1992

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

alpha-beta sequential algorithmefficient parallel searching in a game tree

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• A minimax algorithm better than alpha-beta? Yes and no
• On the complexity of searching game trees and other recursion trees

This page was built for publication: A game tree with distinct leaf values which is easy for the alpha-beta algorithm