Parallel randomized best-first minimax search.

DOI10.1016/S0004-3702(02)00195-9MaRDI QIDQ1605282zbMATHOpenAlexFDO

Authors Yaron Shoham, Sivan Toledo

Publication date 15 July 2002

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(02)00195-9

zbMATH Keywords

OthelloAlpha-BetaChessHeuristic searchBest-firstJamboree searchTwo-player games

Mathematics Subject Classification ID

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

Recommendations

• Best-first minimax search
• A parallel alpha/beta tree searching algorithm
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• Parallel search in bivalued game trees
• On parallel evaluation of game trees

Cites work

• scientific article; zbMATH DE number 43243 (Why is no real title available?)
• scientific article; zbMATH DE number 1057778 (Why is no real title available?)
• An analysis of alpha-beta pruning
• Best-first minimax search

Cited in

(9)

• Advances in Artificial Intelligence
• scientific article; zbMATH DE number 934538 (Why is no real title available?)
• Parallel minimax search for a maximum
• Best-first minimax search
• Evaluation of a simple, scalable, parallel best-first search strategy
• A parallel alpha/beta tree searching algorithm
• The effect of mobility on minimaxing of game trees with random leaf values
• Improving best-reply search
• ENHANCED REALIZATION PROBABILITY SEARCH

Describes a project that uses

Uses Software

• MPI

This page was built for publication: Parallel randomized best-first minimax search.

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