Benefits of using multivalued functions for minimaxing

DOI10.1016/S0004-3702(97)00073-8zbMath0902.90136OpenAlexW2013005486WikidataQ127846297 ScholiaQ127846297MaRDI QIDQ1128640

Hermann Kaindl, Anton Scheucher

Publication date: 13 August 1998

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(97)00073-8

zbMATH Keywords

game treessimulation studiesimproved evaluation qualityminimaxingmultivalued evaluation functions

Mathematics Subject Classification ID

Game theory (91A99) Combinatorial optimization (90C27)

Related Items (4)

When is it better not to look ahead? ⋮ Independent-valued minimax: Pathological or beneficial? ⋮ Is real-valued minimax pathological? ⋮ Partial order bounding: A new approach to evaluation in game tree search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• An investigation of the causes of pathology in games
• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• Pathology on game trees revisited, and an alternative to minimaxing
• On the nature of pathology in game searching
• Best-first minimax search
• On game graph structure and its influence on pathology
• Decision Quality As a Function of Search Depth on Game Trees
• Sokoban: Enhancing general single-agent search methods using domain knowledge

This page was built for publication: Benefits of using multivalued functions for minimaxing