Game tree searching by min/max approximation

DOI10.1016/0004-3702(87)90004-XzbMath0633.68080OpenAlexW2014969765MaRDI QIDQ1096402

Ronald L. Rivest

Publication date: 1988

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

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

zbMATH Keywords

searchingmin/max approximationmin/max game treesplaying computers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05)

Related Items (6)

Best-first minimax search ⋮ A Bayesian approach to relevance in game playing ⋮ Two-agent IDA* ⋮ Improving heuristic mini-max search by supervised learning ⋮ Strategies anticipating a difference in search depth using opponent-model search ⋮ An analysis of the conspiracy numbers algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimax algorithm better than alpha-beta?
• An investigation of the causes of pathology in games
• An analysis of alpha-beta pruning
• 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

This page was built for publication: Game tree searching by min/max approximation