Searching minimax game trees under memory space constraint
type: Item
instance of: scholarly article
title: Searching minimax game trees under memory space constraint
zbMATH Open document ID: 0878.68054
DOI: 10.1007/BF01531075
author: Toshihide Ibaraki
author: Yoshiroh Katoh
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-12-14T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T35
zbMATH DE Number: 1017065
zbMATH Keywords: minimax game trees
MaRDI profile type: Publication
cites work: A generalization of alpha-beta and \(SSS^*\) search procedures
cites work: An analysis of alpha-beta pruning
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Experiments With Some Programs That Search Game Trees
cites work: A minimax algorithm better than alpha-beta?
full work available at URL: https://doi.org/10.1007/bf01531075
OpenAlex ID: W2065596022
Recommended article: Game tree searching by min/max approximation
Recommended article: A general framework for minimax search in game trees
Recommended article: Optimal Search on Some Game Trees
Recommended article: Q5288685
Recommended article: On the complexity of searching game trees and other recursion trees
Recommended article: Q4728287
Recommended article: Asymptotic Properties of Minimax Trees and Game-Searching Procedures
Recommended article: Fast algorithms for finding randomized strategies in game trees
Recommended article: Searching game trees under a partial order
Recommended article: Q3489452
description: scientific article; zbMATH DE number 1017065