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

DOI10.1016/0004-3702(91)90042-IMaRDI QIDQ1190799zbMATH OpenFDO

Authors Ingo Althöfer, Bernhard Balkenhol

Publication date 26 September 1992

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(91)90042-I

zbMATH Keywords

alpha-beta sequential algorithmefficient parallel searching in a game tree

Mathematics Subject Classification ID

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

Review text

The authors discuss the problem of efficient parallel searching in a game tree. They present a specific group of game trees with distinct leaf values in which an easy alpha-beta sequential algorithm exists and is independent of the move ordering.

Recommendations

• A parallel alpha/beta tree searching algorithm
• On parallel evaluation of game trees
• scientific article; zbMATH DE number 4162692
• Optimal Search on Some Game Trees
• A Parallel Game Tree Search Algorithm With A Linear Speedup

Cites work

• A minimax algorithm better than alpha-beta?
• A minimax algorithm better than alpha-beta? Yes and no
• An analysis of alpha-beta pruning
• scientific article; zbMATH DE number 43947 (Why is no real title available?)
• scientific article; zbMATH DE number 815553 (Why is no real title available?)
• On the complexity of searching game trees and other recursion trees

Cited in

(1)

• scientific article; zbMATH DE number 4162692 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190799)