Benefits of using multivalued functions for minimaxing

Artificial Intelligence

Volumn 99, Issue 2, 1998, Pages 187-208

  Scheucher, Anton ^a   Kaindl, Hermann ^b  

^a PSE KB1 Ref3 ^*  (Austria)

^b SIEMENS AG ÖSTERREICH   (Austria)

Author keywords

Game trees; Improved evaluation quality; Minimaxing; Multivalued evaluation functions; Simulation studies

Indexed keywords

COMPUTER SIMULATION; ERROR ANALYSIS; FUNCTION EVALUATION; PROBABILITY; TREES (MATHEMATICS);

MINIMAXING; MULTIVALUED EVALUATION FUNCTIONS;

GAME THEORY;

EID: 0032021818     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00073-8     Document Type: Article

References (35)

1. B. Abramson, An explanation of and cure for minimax pathology, in: L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, North-Holland, Amsterdam, 1986, pp. 495-504.
2. D.F. Beal, An analysis of minimax, in: M.R.B. Clarke (Ed.), Advances in Computer Chess, Vol. 2, Edinburgh University Press, 1980, pp 103-109.
3. D.F. Beal, Benefits of minimax search, in: M.R.B. Clarke (Ed.), Advances in Computer Chess, Vol. 3, Pergamon Press, Oxford, 1982, pp. 17-24.
4. I. Bratko, M. Gams, Error analysis of the minimax principle, in: M.R.B. Clarke (Ed.), Advances in Computer Chess, Vol. 3, Pergamon Press, Oxford, 1982, pp. 1-15.
5. J.H. Condon, K. Thompson, Belle, in: P.W. Frey (Ed.), Chess Skill in Man and Machine, 2nd ed., Springer, Berlin, 1983, pp. 201-210.
6. S.H. Fuller, J.G. Gaschnig, J.J. Gillogly, An analysis of the alpha-beta pruning algorithm, Technical Report, Carnegie Mellon University, Pittsburgh, PA, 1973.
7. H. Horacek, Reasoning with uncertainty in computer chess, Artificial Intelligence 43 (1990) 37-56.
8. H. Horacek, H. Kaindl, M. Wagner, Probabilities in game-playing: possible meanings and applications, in: Proceedings 3rd Austrian Meeting on Artificial Intelligence, Vienna, Springer, Berlin, 1987, pp. 12-23.
9. A. Junghanns, J. Schaeffer, Search versus knowledge in game-playing programs revisited, in: Proceedings IJCAI-97, Nagoya, Japan, 1997.
10. H. Kaindl, Dynamic control of the quiescence search in computer chess, in: Proceedings EMCSR-82, Vienna, North-Holland, Amsterdam, 1982, pp. 973-978,
11. H. Kaindl, Quiescence search in computer chess, in: M.A. Bramer (Ed.), Game-Playing (special issue), SIGART Newsletter 80 (1982) 124-131; Reprinted in: Computer Game-Playing: Theory and Practice, Ellis Horwood, Chichester, UK, 1983. pp. 39-52.
12. H. Kaindl, Quiescence search in computer chess, in: M.A. Bramer (Ed.), Game-Playing (special issue), SIGART Newsletter 80 (1982) 124-131; Reprinted in: Computer Game-Playing: Theory and Practice, Ellis Horwood, Chichester, UK, 1983. pp. 39-52.
13. H. Kaindl, Searching to variable depth in computer chess, in: Proceedings IJCAI-83, Karlsruhe, Germany, 1983, pp. 760-762.
14. H. Kaindl, Minimaxing: theory and practice, Al Magazine 9 (3) (1988) 69-76.
15. H. Kaindl, Tree searching algorithms, in: T.A. Marsland, J. Schaeffer (Eds.), Computers, Chess, and Cognition, Springer, New York, 1990, pp. 133-158.
16. H. Kaindl, A. Scheucher, Reasons for the effects of bounded look-ahead search, IEEE Trans. Systems Man Cybernet. 22 (5) (1992) 992-1007.
17. D.E. Knuth, R.W. Moore, An analysis of alpha-beta pruning, Artificial Intelligence 6 (4) (1975) 293-326.
18. D. Kopec, I. Bratko, The Bratko-Kopec experiment: a comparison of human and computer performance in chess, in: M.R.B. Clarke (Ed.), Advances in Computer Chess, Vol. 3, Pergamon Press, Oxford, 1982, pp. 57-72.
19. R.E. Korf, Depth-first iterative-deepening: an optimal admissible tree search, Artificial Intelligence 27 (1) (1985) 97-109.
20. R.E. Korf, D.M. Chickering, Best-first minimax search, Artificial Intelligence 84 (1996) 299-337.
21. T.A. Marsland, The Bratko-Kopec test revisited, in: T.A. Marsland, J. Schaeffer (Eds.), Computers, Chess, and Cognition, Springer, New York, 1990, pp. 217-223.
22. G. Michon, Recursive random games: a probabilistic model for perfect information games, Ph.D. Thesis, University of California, Los Angeles, CA, 1983.
23. D.S. Nau, Quality of decision versus depth of search on game trees, Ph.D. Thesis, Duke University, Durham, NC, 1979.
24. D.S. Nau, Pathology on game trees: a summary of results, in: Proceedings AAAI-80, Stanford, CA, 1980, pp. 102-104.
25. D.S. Nau, An investigation of the causes of pathology in games, Artificial Intelligence 19 (3) (1982) 257-278.
26. D.S. Nau, Decision quality as a function of search depth on game trees, J. ACM 30 (4) (1983) 687-708.
27. D.S. Nau, On game graph structure and its influence on pathology, Internat. J. Comput. Inform. Sci. 12 (6) (1983) 367-383.
28. D.S. Nau, Pathology on game trees revisited, and an alternative to minimaxing, Artificial Intelligence 21 (1-2) (1983) 221-244.
29. M.M. Newborn, The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores. Artificial Intelligence 8 (1977) 137-153.
30. J. Pearl, On the nature of pathology in game searching, Artificial Intelligence 20 (4) (1983) 427-453.
31. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, MA, 1984.
32. J. Schaeffer, R. Lake, P. Lu, M. Bryant, CHINOOK: the world man-machine checkers champion, AI Magazine 17 (1) (1996) 21-29.
33. A. Scheucher, Untersuchung von Minimaxing in einem mehrwertigen Modell, Diplomarbeit, Wirtschaftsuniversität Wien, 1992.
34. A. Scheucher, H. Kaindl, The reason for the benefits of minimax search, in: Proceedings IJCAI-89, Detroit, MI, 1989, pp. 322-327.
35. G. Schrüfer, Presence and absence of pathology on game trees, in: D.F. Beal (Ed.), Advances in Computer Chess, Vol. 4, Pergamon Press, Oxford, 1986, pp. 101-112.