Multi-player alpha-beta pruning
From MaRDI portal
Publication:753695
DOI10.1016/0004-3702(91)90082-UzbMath0716.90105OpenAlexW2120858222MaRDI QIDQ753695
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
minimax searchalpha-beta pruningasymptotic branching factornon-cooperative, perfect-information games
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) (n)-person games, (n>2) (91A06) Parallel algorithms in computer science (68W10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
Pruning algorithms for multi-model adversary search ⋮ Searching game trees under a partial order ⋮ 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
Cites Work
This page was built for publication: Multi-player alpha-beta pruning
