A minimax algorithm better than alpha-beta? Yes and no
type: Item
instance of: scholarly article
title: A minimax algorithm better than alpha-beta? Yes and no
zbMATH Open document ID: 0507.68063
DOI: 10.1016/S0004-3702(83)80010-1
author: Igor Roizen
author: Judea Pearl
published in: Artificial Intelligence
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 91A35
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 3800964
zbMATH Keywords: probabilistic analysis of the performance of the game-searching SSS* algorithm
zbMATH Keywords: game-tree searching
Wikidata QID: Q29544250
MaRDI profile type: Publication
cites work: An analysis of alpha-beta pruning
cites work: On the branching factor of the alpha-beta pruning algorithm
cites work: The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
cites work: A minimax algorithm better than alpha-beta?
cites work: Q3856120
cites work: Asymptotic properties of minimax trees and game-searching procedures
cites work: Q5592596
cites work: A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
cites work: A comparison of minimax tree search algorithms
full work available at URL: s0004-3702(83)80010-1
OpenAlex ID: W1971037297
description: scientific article; zbMATH DE number 3800964