Multi-player alpha-beta pruning

DOI10.1016/0004-3702(91)90082-UzbMATH Open0716.90105OpenAlexW2120858222MaRDI QIDQ753695FDOQ753695

Authors: Richard E. Korf 

Publication date: 1991

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(91)90082-u

Recommendations

• Publication:3489505
• Multi-cut \(\alpha \beta\)-pruning in game-tree search
• An analysis of the full alpha-beta pruning algorithm
• scientific article; zbMATH DE number 1944388
• Pruning algorithms for multi-model adversary search

zbMATH Keywords

alpha-beta pruningminimax searchasymptotic branching factornon-cooperative, perfect-information games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Parallel algorithms in computer science (68W10) (n)-person games, (n>2) (91A06)

Cites Work

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

Cited In (11)

• Pruning algorithms for multi-model adversary search
• On pruning search trees of impartial games
• Title not available (Why is that?)
• Title not available (Why is that?)
• An analysis of the full alpha-beta pruning algorithm
• Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
• The multi-player version of minimax displays game-tree pathology
• Two-agent IDA*
• Searching game trees under a partial order
• Title not available (Why is that?)
• Multi-cut \(\alpha \beta\)-pruning in game-tree search

This page was built for publication: Multi-player alpha-beta pruning

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