Best-first fixed-depth minimax algorithms
From MaRDI portal
Publication:2676580
DOI10.1016/0004-3702(95)00126-3zbMath1506.68127DBLPjournals/ai/PlaatSPB96OpenAlexW2088182101WikidataQ55920594 ScholiaQ55920594MaRDI QIDQ2676580
Aske Plaat, Arie de Bruin, Wim Pijls, Jonathan Schaeffer
Publication date: 27 September 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(95)00126-3
Related Items (12)
An effective two-level proof-number search algorithm ⋮ Eigen-distribution on random assignments for game trees ⋮ Proof-Number Search and Its Variants ⋮ Method of outer approximations and adaptive approximations for a class of matrix games ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Partial order bounding: A new approach to evaluation in game tree search ⋮ Games solved: Now and in the future ⋮ Strategies anticipating a difference in search depth using opponent-model search ⋮ A solution to the GHI problem for best-first search ⋮ Sokoban: Improving the search with relevance cuts ⋮ Unifying single-agent and two-player search ⋮ Tuning evaluation functions by maximizing concordance
Cites Work
- Unnamed Item
- Unnamed Item
- A faster alternative to \(SSS^*\) with extension to variable memory
- Depth-first iterative-deepening: An optimal admissible tree search
- A generalization of alpha-beta and \(SSS^*\) search procedures
- Conspiracy numbers for min-max search
- A minimax algorithm better than alpha-beta?
- Asymptotic properties of minimax trees and game-searching procedures
- An analysis of alpha-beta pruning
- Proof-number search
- Game tree algorithms and solution trees
- A minimax algorithm better than alpha-beta? Yes and no
- A comparison of minimax tree search algorithms
- The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
This page was built for publication: Best-first fixed-depth minimax algorithms
