Parallel randomized best-first minimax search.

DOI10.1016/S0004-3702(02)00195-9zbMATH Open1052.68023OpenAlexW2025239527MaRDI QIDQ1605282FDOQ1605282

Sivan Toledo, Yaron Shoham

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)

Cites Work

• An analysis of alpha-beta pruning
• Best-first minimax search
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• The effect of mobility on minimaxing of game trees with random leaf values
• Parallel minimax search for a maximum
• Title not available (Why is that?)
• Evaluation of a simple, scalable, parallel best-first search strategy

Uses Software

• MPI

   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 👍 👎

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)