A minimax algorithm better than alpha-beta?
type: Item
instance of: scholarly article
title: A minimax algorithm better than alpha-beta?
zbMATH Open document ID: 0418.68041
DOI: 10.1016/0004-3702(79)90016-X
published in: Artificial Intelligence
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 3651745
zbMATH Keywords: minimax algorithm
zbMATH Keywords: alpha-beta
zbMATH Keywords: state space search
zbMATH Keywords: computing the minimax value of game trees
zbMATH Keywords: storage requirement
zbMATH Keywords: execution time data
zbMATH Keywords: efficiency
author: George C. Stockman
MaRDI profile type: Publication
cites work: On the branching factor of the alpha-beta pruning algorithm
cites work: An analysis of alpha-beta pruning
cites work: The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
cites work: Experiments With Some Programs That Search Game Trees
full work available at URL: 0004-3702(79)90016-x
OpenAlex ID: W1982977005
description: scientific article; zbMATH DE number 3651745