Game tree algorithms and solution trees
From MaRDI portal
Recommendations
Cites work
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- A generalization of alpha-beta and SSS^* search procedures
- A minimax algorithm better than alpha-beta?
- A minimax algorithm better than alpha-beta? Yes and no
- An analysis of alpha-beta pruning
- Artificial intelligence in perspective: a retrospective on fifty volumes of the Artificial Intelligence journal
- Parallelism in alpha-beta search
Cited in
(10)- Game tree searching by min/max approximation
- On solving the 7,7,5-game and the 8,8,5-game
- Searching game trees under a partial order
- Best-first fixed-depth minimax algorithms
- A Dynamic Algorithm for Reachability Games Played on Trees
- scientific article; zbMATH DE number 4162309 (Why is no real title available?)
- On the complexity of searching game trees and other recursion trees
- scientific article; zbMATH DE number 7362735 (Why is no real title available?)
- The tree search game for two players
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
This page was built for publication: Game tree algorithms and solution trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589517)