Pathology on game trees revisited, and an alternative to minimaxing
type: Item
instance of: scholarly article
title: Pathology on game trees revisited, and an alternative to minimaxing
zbMATH Open document ID: 0507.68064
DOI: 10.1016/S0004-3702(83)80011-3
author: Dana S. Nau
published in: Artificial Intelligence
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 91A35
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 3800965
zbMATH Keywords: game tree search
zbMATH Keywords: probabilistic decision procedure
MaRDI profile type: Publication
cites work: On the branching factor of the alpha-beta pruning algorithm
cites work: Q3904064
cites work: An analysis of alpha-beta pruning
cites work: Decision Quality As a Function of Search Depth on Game Trees
cites work: An investigation of the causes of pathology in games
cites work: The last player theorem
cites work: The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
cites work: Q3856120
cites work: Asymptotic properties of minimax trees and game-searching procedures
cites work: On the nature of pathology in game searching
cites work: A minimax algorithm better than alpha-beta?
description: scientific article; zbMATH DE number 3800965