Game tree searching by min/max approximation
From MaRDI portal
Publication:1096402
DOI10.1016/0004-3702(87)90004-XzbMath0633.68080MaRDI QIDQ1096402
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
Related Items
Two-agent IDA*, Improving heuristic mini-max search by supervised learning, A Bayesian approach to relevance in game playing, An analysis of the conspiracy numbers algorithm, Strategies anticipating a difference in search depth using opponent-model search, Best-first minimax search
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