Searching minimax game trees under memory space constraint

DOI10.1007/BF01531075zbMath0878.68054OpenAlexW2065596022MaRDI QIDQ1356215

Toshihide Ibaraki, Yoshiroh Katoh

Publication date: 14 December 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01531075

zbMATH Keywords

minimax game trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search
• A generalization of alpha-beta and \(SSS^*\) search procedures
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• Experiments With Some Programs That Search Game Trees

This page was built for publication: Searching minimax game trees under memory space constraint