Trends in game tree search
From MaRDI portal
Publication:6560188
Recommendations
Cites work
- A faster alternative to \(SSS^*\) with extension to variable memory
- 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
- On the branching factor of the alpha-beta pruning algorithm
This page was built for publication: Trends in game tree search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560188)