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

DOI10.1016/0004-3702(91)90042-IzbMATH Open0755.90108MaRDI QIDQ1190799FDOQ1190799

Authors: Ingo Althöfer, Bernhard Balkenhol 

Publication date: 26 September 1992

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

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

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)

Cites Work

• An analysis of alpha-beta pruning
• Title not available (Why is that?)
• Title not available (Why is that?)
• A minimax algorithm better than alpha-beta?
• On the complexity of searching game trees and other recursion trees
• A minimax algorithm better than alpha-beta? Yes and no

Cited In (1)

• Title not available (Why is that?)

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)