A comparison of minimax tree search algorithms
From MaRDI portal
Publication:1838331
DOI10.1016/0004-3702(83)90001-2zbMATH Open0509.68104OpenAlexW1974281669MaRDI QIDQ1838331FDOQ1838331
Authors: Murray Campbell, T. A. Marsland 
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
Cites Work
- An analysis of alpha-beta pruning
- Asymptotic properties of minimax trees and game-searching procedures
- On the branching factor of the alpha-beta pruning algorithm
- Experiments With Some Programs That Search Game Trees
- A minimax algorithm better than alpha-beta?
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- Title not available (Why is that?)
Cited In (13)
- Best-first fixed-depth minimax algorithms
- A minimax algorithm better than alpha-beta? Yes and no
- Game tree searching by min/max approximation
- Eigen-distribution on random assignments for game trees
- Artificial intelligence for games
- Computer Go: An AI oriented survey
- Simulation-based search
- Proof-number search
- Two-agent IDA*
- Autonomous agents modelling other agents: a comprehensive survey and open problems
- A generalization of alpha-beta and \(SSS^*\) search procedures
- AWT: Aspiration with Timer Search Algorithm in Siguo
- Extended Null-Move Reductions
This page was built for publication: A comparison of minimax tree search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838331)
