Trends in game tree search

DOI10.1007/BFB0037408zbMATH Open1541.68119MaRDI QIDQ6560188FDOQ6560188

Authors: Arie de Bruin, Wim Pijls 

Publication date: 21 June 2024

Recommendations

• Best-first fixed-depth minimax algorithms
• A general framework for minimax search in game trees
• scientific article; zbMATH DE number 1927212
• A generalization of alpha-beta and \(SSS^*\) search procedures
• Best-first minimax search

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Algorithmic game theory and complexity (91A68)

Cites Work

• An analysis of alpha-beta pruning
• On the branching factor of the alpha-beta pruning algorithm
• A minimax algorithm better than alpha-beta?
• 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? Yes and no

Cited In (1)

• Artificial intelligence for games

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)