Bias and pathology in minimax search

Theoretical Computer Science

Volumn 349, Issue 2, 2005, Pages 268-281

  Sadikov, A ^a   Bratko, I ^a   Kononenko, I ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Bias; Evaluation function quality; KRK chess endgame; Minimax pathology; Minimax principle

Indexed keywords

ERROR ANALYSIS; FUNCTION EVALUATION; GAME THEORY; HEURISTIC METHODS; PATHOLOGY;

BIAS; EVALUATION-FUNCTION QUALITY; KRK CHESS GAME; MINIMAX PATHOLOGY; MINIMAX PRINCIPLE;

COMPUTER SCIENCE;

EID: 27844608479     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.073     Document Type: Article

References (16)

1. B. Abramson An explanation of and cure for minimax pathology L.N. Kanal J.F. Lemmer Proc. of First Conf. on Uncertainty in Artificial Intelligence 1986 North-Holland Publishers 495 504
2. I. Althöfer Generalized minimax algorithms are no better error correctors than minimax itself D.F. Beal Advances in Computer Chess 5 1989 Elsevier Science Publishers Amsterdam 265 282
3. M. Bain Learning optimal chess strategies S. Muggleton Proc. Internat. Workshop on Inductive Logic Programming 1992 Institute for New Generation Computer Technology Tokyo
4. D.F. Beal An analysis of minimax M.R.B. Clarke Advances in Computer Chess 2 1980 Edinburgh University Press Edinburgh 103 109
5. D.F. Beal Benefits of minimax search M.R.B. Clarke Advances in Computer Chess 3 1982 Pergamon Press Oxford 1 15
6. D.F. Beal, and M.C. Smith Random evaluations in chess ICCA J. 17 1 1994 3 9
7. C.L. Blake, and C.J. Merz UCI Repository of machine learning databases, Department of Information and Computer Science 1998 University of California Irvine, CA http://www.ics.uci.edu/ ∼ mlearn/MLRepository.html
8. I. Bratko, and M. Gams Error analysis of the minimax principle M.R.B. Clarke Advances in Computer Chess 3 1982 Pergamon Press Oxford 1 15
9. M. Levene, and T.I. Fenner A partial analysis of minimaxing game trees with random leaf values ICCA J. 18 1 1995 20 33
10. M. Levene, and T.I. Fenner The effect of mobility on minimaxing of game trees with random leaf values Artificial Intelligence J. 130 1 2001 1 26
11. D.S. Nau, Quality of decision versus depth of search on game trees, Ph.D. dissertation, Duke University, 1979.
12. D.S. Nau, Preliminary results regarding quality of play versus depth of search in game playing, in: Proc. of First Internat. Symp. on Policy Analysis and Information Systems, 1979, pp. 210-217.
13. D.S. Nau An investigation of the causes of pathology in games Artificial Intelligence 19 1982 257 278
14. D.S. Nau Pathology on game trees revisited and an alternative to minimaxing, Artificial Intelligence 21 1-2 1983 221 244
15. J. Pearl Heuristics: Intelligent Search Strategies for Computer Problem Solving 1984 Addison-Wesley Reading, MA
16. G. Schrüfer Presence and absence of pathology on game trees D.F. Beal Advances in Computer Chess 4 1986 Pergamon Press Oxford 101 112