scientific article; zbMATH DE number 4162692

MaRDI QIDQ3489817zbMATH OpenFDO

Authors Max Böhm, Ewald Speckenmeyer

Publication date 1990

zbMATH Keywords

alpha-beta-search methoddynamic processor tree algorithmminimax proceduresminimax valueroot of a game tree

Mathematics Subject Classification ID

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

Recommendations

• Parallel search in bivalued game trees
• A parallel alpha/beta tree searching algorithm
• On parallel evaluation of game trees
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• A game tree with distinct leaf values which is easy for the alpha-beta algorithm

Cited in

(11)

• A parallel alpha/beta tree searching algorithm
• A game tree with distinct leaf values which is easy for the alpha-beta algorithm
• APHID: Asynchronous parallel game-tree search
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• On parallel evaluation of game trees
• scientific article; zbMATH DE number 4162263 (Why is no real title available?)
• scientific article; zbMATH DE number 5642148 (Why is no real title available?)
• Unsynchronized iteratively deepening parallel alpha-beta search
• scientific article; zbMATH DE number 1760141 (Why is no real title available?)
• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
• Parallel search in bivalued game trees

This page was built for publication:

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