Independent-valued minimax: Pathological or beneficial?
From MaRDI portal
Publication:417993
DOI10.1016/J.TCS.2011.11.033zbMATH Open1237.91052OpenAlexW2073455175MaRDI QIDQ417993FDOQ417993
Matjaž Gams, Mitja Luštrek, Ivan Bratko
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Other game-theoretic models (91A40) Experimental studies (91A90)
Cites Work
- Title not available (Why is that?)
- Deep Blue
- Is real-valued minimax pathological?
- Asymptotic properties of minimax trees and game-searching procedures
- When is it better not to look ahead?
- Benefits of using multivalued functions for minimaxing
- 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
- Decision Quality As a Function of Search Depth on Game Trees
- Title not available (Why is that?)
- Bias and pathology in minimax search
- Error propagation in game trees
Uses Software
Recommendations
This page was built for publication: Independent-valued minimax: Pathological or beneficial?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417993)