An investigation of the causes of pathology in games

DOI10.1016/0004-3702(82)90002-9zbMath0503.68070OpenAlexW1978126279WikidataQ56020942 ScholiaQ56020942MaRDI QIDQ1173415

Dana S. Nau

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0004-3702(82)90002-9

zbMATH Keywords

decision analysisdecision treessearchgame treesminimaxing

Mathematics Subject Classification ID

Minimax procedures in statistical decision theory (62C20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory for games (91A35)

Related Items

Game tree searching by min/max approximation ⋮ Asymptotic properties of level-regular decision trees with randomly evaluated leaves ⋮ Best-first minimax search ⋮ Benefits of using multivalued functions for minimaxing ⋮ When is it better not to look ahead? ⋮ Independent-valued minimax: Pathological or beneficial? ⋮ On look-ahead and pathology in decision tree learning ⋮ Is real-valued minimax pathological? ⋮ Remarks on History and Presence of Game Tree Search and Research ⋮ On game graph structure and its influence on pathology ⋮ Pathology on game trees revisited, and an alternative to minimaxing ⋮ On the nature of pathology in game searching ⋮ The multi-player version of minimax displays game-tree pathology ⋮ A study of decision error in selective game tree search ⋮ Bias and pathology in minimax search

Cites Work

• Unnamed Item
• Asymptotic properties of minimax trees and game-searching procedures
• The last player theorem
• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• On the branching factor of the alpha-beta pruning algorithm
• A chronology of computer chess and its literature
• Decision Quality As a Function of Search Depth on Game Trees