A minimax algorithm better than alpha-beta?
From MaRDI portal
Publication:1131840
DOI10.1016/0004-3702(79)90016-XzbMath0418.68041MaRDI QIDQ1131840
Publication date: 1979
Published in: Artificial Intelligence (Search for Journal in Brave)
efficiency; minimax algorithm; storage requirement; state space search; alpha-beta; computing the minimax value of game trees; execution time data
68Q25: Analysis of algorithms and problem complexity
68T10: Pattern recognition, speech recognition
68T99: Artificial intelligence
68R99: Discrete mathematics in relation to computer science
Related Items
Two-agent IDA*, Computer Go: An AI oriented survey, A faster alternative to \(SSS^*\) with extension to variable memory, General branch and bound, and its relation to \(A^*\) and \(AO^*\), A quantitative analysis of the alpha-beta pruning algorithm, A generalization of alpha-beta and \(SSS^*\) search procedures, Game tree searching by min/max approximation, Conspiracy numbers for min-max search, Asymptotic properties of minimax trees and game-searching procedures, The last player theorem, A game tree with distinct leaf values which is easy for the alpha-beta algorithm, Proof-number search, An analysis of the conspiracy numbers algorithm, A general framework for minimax search in game trees, Searching minimax game trees under memory space constraint, A solution to the GHI problem for best-first search, Game tree algorithms and solution trees, Is SSS* better than alpha-beta?, A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures, A minimax algorithm better than alpha-beta? Yes and no, Pathology on game trees revisited, and an alternative to minimaxing, A comparison of minimax tree search algorithms, A general heuristic bottom-up procedure for searching AND/OR graphs, On game graph structure and its influence on pathology, AWT: Aspiration with Timer Search Algorithm in Siguo
Cites Work
