A minimax algorithm better than alpha-beta?

DOI10.1016/0004-3702(79)90016-XzbMath0418.68041OpenAlexW1982977005MaRDI QIDQ1131840

George C. Stockman

Publication date: 1979

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(79)90016-x

zbMATH Keywords

efficiencyminimax algorithmstorage requirementstate space searchalpha-betacomputing the minimax value of game treesexecution time data

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Artificial intelligence (68T99) Discrete mathematics in relation to computer science (68R99)

Related Items (29)

A generalization of alpha-beta and \(SSS^*\) search procedures ⋮ A general framework for minimax search in game trees ⋮ Game tree searching by min/max approximation ⋮ Searching minimax game trees under memory space constraint ⋮ A general heuristic bottom-up procedure for searching AND/OR graphs ⋮ Conspiracy numbers for min-max search ⋮ Best-first minimax search ⋮ Searching game trees under a partial order ⋮ Best-first fixed-depth minimax algorithms ⋮ 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 ⋮ A faster alternative to \(SSS^*\) with extension to variable memory ⋮ On game graph structure and its influence on pathology ⋮ AWT: Aspiration with Timer Search Algorithm in Siguo ⋮ Two-agent IDA* ⋮ Computer Go: An AI oriented survey ⋮ On solving the 7,7,5-game and the 8,8,5-game ⋮ 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 ⋮ General branch and bound, and its relation to \(A^*\) and \(AO^*\) ⋮ A solution to the GHI problem for best-first search ⋮ Game tree algorithms and solution trees ⋮ A quantitative analysis of the alpha-beta pruning algorithm ⋮ Proof-number search ⋮ An analysis of the conspiracy numbers algorithm

Cites Work

• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• On the branching factor of the alpha-beta pruning algorithm
• Experiments With Some Programs That Search Game Trees

This page was built for publication: A minimax algorithm better than alpha-beta?