A comparison of minimax tree search algorithms

DOI10.1016/0004-3702(83)90001-2zbMath0509.68104OpenAlexW1974281669MaRDI QIDQ1838331

T. A. Marsland, Murray S. Campbell

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0004-3702(83)90001-2

zbMATH Keywords

game-searching algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Game theory (91A99) Artificial intelligence (68T99)

Related Items (12)

A generalization of alpha-beta and \(SSS^*\) search procedures ⋮ Game tree searching by min/max approximation ⋮ Autonomous agents modelling other agents: a comprehensive survey and open problems ⋮ Eigen-distribution on random assignments for game trees ⋮ Best-first fixed-depth minimax algorithms ⋮ Simulation-based search ⋮ Extended Null-Move Reductions ⋮ AWT: Aspiration with Timer Search Algorithm in Siguo ⋮ Two-agent IDA* ⋮ Computer Go: An AI oriented survey ⋮ A minimax algorithm better than alpha-beta? Yes and no ⋮ Proof-number search

Cites Work

• Unnamed Item
• A minimax algorithm better than alpha-beta?
• Asymptotic properties of minimax trees and game-searching procedures
• 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 comparison of minimax tree search algorithms