Independent-valued minimax: Pathological or beneficial?

DOI10.1016/J.TCS.2011.11.033zbMath1237.91052OpenAlexW2073455175MaRDI QIDQ417993

Mitja Luštrek, Ivan Bratko, Matjaz Gams

Publication date: 14 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.033

zbMATH Keywords

minimax principleminimax pathologyposition independencereal values

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Experimental studies (91A90)

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• When is it better not to look ahead?
• Bias and pathology in minimax search
• Error propagation in game trees
• Benefits of using multivalued functions for minimaxing
• Asymptotic properties of minimax trees and game-searching procedures
• The last player theorem
• An investigation of the causes of pathology in games
• Pathology on game trees revisited, and an alternative to minimaxing
• On the nature of pathology in game searching
• Error analysis in minimax trees
• Is real-valued minimax pathological?
• Decision Quality As a Function of Search Depth on Game Trees
• Deep Blue

This page was built for publication: Independent-valued minimax: Pathological or beneficial?