Asymptotic properties of minimax trees and game-searching procedures
type: Item
instance of: scholarly article
title: Asymptotic properties of minimax trees and game-searching procedures
zbMATH Open document ID: 0445.68048
DOI: 10.1016/0004-3702(80)90037-5
author: Judea Pearl
published in: Artificial Intelligence
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 3696515
zbMATH Keywords: minimax trees
zbMATH Keywords: game-searching
zbMATH Keywords: search tree
Wikidata QID: Q56141856
MaRDI profile type: Publication
full work available at URL: 0004-3702(80)90037-5
OpenAlex ID: W2017359019
cites work: On the branching factor of the alpha-beta pruning algorithm
cites work: An analysis of alpha-beta pruning
cites work: Experiments With Some Programs That Search Game Trees
cites work: A minimax algorithm better than alpha-beta?
DBLP publication ID: journals/ai/Pearl80
description: scientific article; zbMATH DE number 3696515