Is real-valued minimax pathological?

Artificial Intelligence

Volumn 170, Issue 6-7, 2006, Pages 620-642

  Luštrek, Mitja ^a   Gams, Matjaž ^a   Bratko, Ivan ^b  

^a JO EF STEFAN INSTITUTE   (Slovenia)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Chess; Game playing; Game tree; Minimax; Pathology; Real value

Indexed keywords

HEURISTIC PROGRAMMING; MATHEMATICAL MODELS; PATHOLOGY; TREES (MATHEMATICS);

CHESS; GAME PLAYING; GAME TREE; MINIMAX; REAL VALUE;

GAME THEORY;

EID: 33645365213     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.01.006     Document Type: Article

References (20)

1. I. Althöfer Generalized minimax algorithms are no better error correctors than minimax itself D.F. Beal Advances in Computer Chess, vol. 5 1989 North-Holland Amsterdam 265 282
2. D.F. Beal An analysis of minimax M.R.B. Clarke Advances in Computer Chess, vol. 2 1980 Edinburgh University Press Edinburgh 103 109
3. D.F. Beal Benefits of minimax search M.R.B. Clarke Advances in Computer Chess, vol. 3 1982 Pergamon Press 17 24
4. I. Bratko, and M. Gams Error analysis of the minimax principle M.R.B. Clarke Advances in Computer Chess, vol. 3 1982 Pergamon Press 1 15
5. S.H. Fuller, J.G. Gaschnig, J.J. Gillogly, An analysis of the alpha-beta pruning algorithm, Technical Report, Carnegie Mellon University, 1973
6. R. Hyatt Home page http://www.cis.uab.edu/info/faculty/hyatt/hyatt.html 2004-04-21
7. D.E. Knuth, and R.W. Moore An analysis of alpha-beta pruning Artificial Intelligence 6 4 1975 293 326
8. M. Luštrek, Minimax pathology and real-number minimax model, in: B. Zajc, A. Trost (Eds.), Proceedings of the Thirteenth International Electrotechnical and Computer Science Conference, vol. B, Portorož, Slovenia, Slovenian Section IEEE, Ljubljana, Slovenia, 2004, pp. 137-140
9. M. Luštrek, M. Gams, Minimaks in napaka pri ocenjavanju položajev, in: M. Bohanec, B. Filipič, M. Gams, D. Trček, B. Likar (Eds.), Proceedings A of the 6th International Multi-Conference Information Society IS 2003, 2003, pp. 89-92
10. D.S. Nau, Quality of decision versus depth of search on game trees, Ph.D. thesis, Duke University, 1979
11. D.S. Nau An investigation of the causes of pathology in games Artificial Intelligence 19 3 1982 257 278
12. D.S. Nau Decision quality as a function of search depth on game trees J. Assoc. Comput. Mach. 30 4 1983 607 708
13. D.S. Nau Pathology on game trees revisited, and an alternative to minimaxing Artificial Intelligence 21 1, 2 1983 221 224
14. D.S. Nau, How to do worse by working harder: The nature of pathology on game trees, in: Proceedings of 1983 IEEE International Conference on Systems, Man, and Cybernetics, 1983
15. M.M. Newborn The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores Artificial Intelligence 8 2 1977 137 153
16. J. Pearl On the nature of pathology in game searching Artificial Intelligence 20 4 1983 427 453
17. A. Sadikov, I. Bratko, and I. Kononenko Search vs knowledge: Empirical study of minimax on KRK endgame H.J. van den Herik H. Iida E. Heinz Advances in Computer Games: Many Games, Many Challenges 2003 Kluwer Academic Dordrecht 33 44
18. A. Scheucher, and H. Kaindl Benefits of using multivalued functions for minimaxing Artificial Intelligence 99 2 1998 187 208
19. G. Schrüfer Presence and absence of pathology on game trees D.F. Beal Advances in Computer Chess, vol. 4 1986 Pergamon Press 101 112
20. B. Sjörgen Swedish Chess Computer Association website http://w1.859.telia.com/~u85924109/ssdf/ 2004-04-21