Best-first fixed-depth minimax algorithms

DOI10.1016/0004-3702(95)00126-3MaRDI QIDQ2676580zbMATH OpenOpenAlexDBLPWikidataFDO

Authors A. Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin

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

zbMATH Keywords

alpha-betagame-tree searchminimax searchnull-window searchsolution treesSSS*transposition tables

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Best-first minimax search
• A general framework for minimax search in game trees
• scientific article; zbMATH DE number 1927212
• A generalization of alpha-beta and SSS^* search procedures
• scientific article; zbMATH DE number 4001519

Cites work

• A comparison of minimax tree search algorithms
• A faster alternative to \(SSS^*\) with extension to variable memory
• A generalization of alpha-beta and SSS^* search procedures
• A minimax algorithm better than alpha-beta?
• A minimax algorithm better than alpha-beta? Yes and no
• An analysis of alpha-beta pruning
• Asymptotic properties of minimax trees and game-searching procedures
• Conspiracy numbers for min-max search
• Depth-first iterative-deepening: An optimal admissible tree search
• Game tree algorithms and solution trees
• scientific article; zbMATH DE number 42543 (Why is no real title available?)
• scientific article; zbMATH DE number 46977 (Why is no real title available?)
• Proof-number search
• The solution for the branching factor of the alpha-beta pruning algorithm and its optimality

Cited in

(30)

• A generalization of alpha-beta and SSS^* search procedures
• A general framework for minimax search in game trees
• 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
• An effective two-level proof-number search algorithm
• Best-first minimax search
• Eigen-distribution on random assignments for game trees
• Improving best-reply search
• Method of outer approximations and adaptive approximations for a class of matrix games
• scientific article; zbMATH DE number 4162314 (Why is no real title available?)
• Extended Null-Move Reductions
• scientific article; zbMATH DE number 16320 (Why is no real title available?)
• scientific article; zbMATH DE number 67462 (Why is no real title available?)
• Two-agent IDA*
• scientific article; zbMATH DE number 1759672 (Why is no real title available?)
• MCTS-minimax hybrids with state evaluations
• Structured best arm identification with fixed confidence
• scientific article; zbMATH DE number 1927212 (Why is no real title available?)
• scientific article; zbMATH DE number 4001519 (Why is no real title available?)
• scientific article; zbMATH DE number 2088035 (Why is no real title available?)
• Proof-Number Search and Its Variants
• 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
• Trends in game tree search
• Artificial intelligence for games
• A faster alternative to \(SSS^*\) with extension to variable memory
• Tuning evaluation functions by maximizing concordance

This page was built for publication: Best-first fixed-depth minimax algorithms

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