A comparison of minimax tree search algorithms
From MaRDI portal
Publication:1838331
Cites work
- scientific article; zbMATH DE number 3723845 (Why is no real title available?)
- A minimax algorithm better than alpha-beta?
- An analysis of alpha-beta pruning
- Asymptotic properties of minimax trees and game-searching procedures
- 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
(13)- A minimax algorithm better than alpha-beta? Yes and no
- A generalization of alpha-beta and \(SSS^*\) search procedures
- Computer Go: An AI oriented survey
- Artificial intelligence for games
- Best-first fixed-depth minimax algorithms
- AWT: Aspiration with Timer Search Algorithm in Siguo
- Extended Null-Move Reductions
- Eigen-distribution on random assignments for game trees
- Proof-number search
- Autonomous agents modelling other agents: a comprehensive survey and open problems
- Simulation-based search
- Game tree searching by min/max approximation
- Two-agent IDA*
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)