Parallel search in bivalued game trees

DOI10.1016/0743-7315(91)90132-SzbMATH Open0733.68037MaRDI QIDQ809606FDOQ809606

Authors: Klaus Zeppenfeld 

Publication date: 1991

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4162692
• A parallel alpha/beta tree searching algorithm
• On parallel evaluation of game trees
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• Unsynchronized iteratively deepening parallel alpha-beta search

zbMATH Keywords

parallel programminggame tree searchprobabilistic game tree model

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15) Games involving graphs (91A43)

Cited In (9)

• Title not available (Why is that?)
• Parallel randomized best-first minimax search.
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• A parallel alpha/beta tree searching algorithm
• On parallel evaluation of game trees
• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
• Title not available (Why is that?)
• A parallel search game
• Title not available (Why is that?)

This page was built for publication: Parallel search in bivalued game trees

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