A minimax algorithm better than alpha-beta?

DOI10.1016/0004-3702(79)90016-XMaRDI QIDQ1131840zbMATH OpenOpenAlexFDO

Authors 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

alpha-betacomputing the minimax value of game treesefficiencyexecution time dataminimax algorithmstate space searchstorage requirement

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(32)

• 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
• Best-first minimax search
• On solving the 7,7,5-game and the 8,8,5-game
• A general heuristic bottom-up procedure for searching AND/OR graphs
• Searching game trees under a partial order
• Best-first fixed-depth minimax algorithms
• 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
• Trends in game tree search
• Mapping tree-structured combinatorial optimization problems onto parallel computers
• Artificial intelligence for games
• A faster alternative to \(SSS^*\) with extension to variable memory
• General branch and bound, and its relation to A^* and AO^*

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

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