A generalization of alpha-beta and \(SSS^*\) search procedures
From MaRDI portal
Publication:1076524
DOI10.1016/0004-3702(86)90092-5zbMath0593.68074OpenAlexW2019928791MaRDI QIDQ1076524
Publication date: 1986
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(86)90092-5
Related Items (4)
A general framework for minimax search in game trees ⋮ Searching minimax game trees under memory space constraint ⋮ Best-first fixed-depth minimax algorithms ⋮ Game tree algorithms and solution trees
Cites Work
- A world-championship-level Othello program
- A quantitative analysis of the alpha-beta pruning algorithm
- A minimax algorithm better than alpha-beta?
- Asymptotic properties of minimax trees and game-searching procedures
- An analysis of alpha-beta pruning
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- On the branching factor of the alpha-beta pruning algorithm
- 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
- A comparison of minimax tree search algorithms
- An admissible and optimal algorithm for searching AND/OR graphs
- The technology chess program
- The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
- Experiments With Some Programs That Search Game Trees
This page was built for publication: A generalization of alpha-beta and \(SSS^*\) search procedures