Game tree algorithms and solution trees
From MaRDI portal
Publication:1589517
DOI10.1016/S0304-3975(00)00082-7zbMath0954.68116OpenAlexW1964867441MaRDI QIDQ1589517
Publication date: 12 December 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00082-7
Related Items
Best-first fixed-depth minimax algorithms, Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition, On solving the 7,7,5-game and the 8,8,5-game
Cites Work
- A generalization of alpha-beta and \(SSS^*\) search procedures
- A minimax algorithm better than alpha-beta?
- Parallelism in alpha-beta search
- An analysis of alpha-beta pruning
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- A minimax algorithm better than alpha-beta? Yes and no
- Artificial intelligence in perspective: a retrospective on fifty volumes of the Artificial Intelligence journal