The multi-player version of minimax displays game-tree pathology

DOI10.1016/0004-3702(93)90108-NzbMath0803.90133OpenAlexW2021571833MaRDI QIDQ1313961

David Mutchler

Publication date: 24 February 1994

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(93)90108-n

zbMATH Keywords

game treesearch proceduremulti-player game treesmulti-player version of minimax

Mathematics Subject Classification ID

Decision theory (91B06) Searching and sorting (68P10) Noncooperative games (91A10)

Related Items (1)

The multi-player version of minimax displays game-tree pathology

Cites Work

• Multi-player alpha-beta pruning
• The *-minimax search procedure for trees containing chance nodes
• Asymptotic properties of minimax trees and game-searching procedures
• The last player theorem
• An investigation of the causes of pathology in games
• An analysis of alpha-beta pruning
• The multi-player version of minimax displays game-tree pathology
• Pathology on game trees revisited, and an alternative to minimaxing
• On the nature of pathology in game searching
• On game graph structure and its influence on pathology
• Decision Quality As a Function of Search Depth on Game Trees
• Experiments With Some Programs That Search Game Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The multi-player version of minimax displays game-tree pathology