Multi-player alpha-beta pruning
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
- Multi-cut \(\alpha \beta\)-pruning in game-tree search
- scientific article; zbMATH DE number 1696767 (Why is no real title available?)
- An analysis of the full alpha-beta pruning algorithm
- On pruning search trees of impartial games
- The multi-player version of minimax displays game-tree pathology
- Pruning algorithms for multi-model adversary search
- scientific article; zbMATH DE number 1944388 (Why is no real title available?)
- Searching game trees under a partial order
- Two-agent IDA*
- scientific article; zbMATH DE number 4162309 (Why is no real title available?)
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)