Unsynchronized iteratively deepening parallel alpha-beta search

DOI10.1109/34.6777MaRDI QIDQ3809315zbMATH OpenOpenAlexFDO

Authors Monroe M. Newborn

Publication date 1988

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/34.6777

zbMATH Keywords

alpha-beta searchgame-playing programsparallel algorithmtree decomposition

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

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

Cited in

(2)

• APHID: Asynchronous parallel game-tree search
• Parallel search in bivalued game trees

This page was built for publication: Unsynchronized iteratively deepening parallel alpha-beta search

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