Tuning evaluation functions by maximizing concordance

Theoretical Computer Science

Volumn 349, Issue 2, 2005, Pages 202-229

  Gomboc, D ^a   Buro, M ^a   Marsland, T A ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Computer chess; Gradient ascent; Heuristic evaluation function; Heuristic search; Kendall's (tau); Ordinal correlation; Partial sum transform

Indexed keywords

CORRELATION METHODS; FUNCTIONS; GAME THEORY; OPTIMIZATION;

COMPUTER CHESS; GRADIENT ASCENT; HEURISTIC EVALUATION FUNCTION; HEURISTIC SEARCH; KENDALL'S (TAU); ORDINAL CORRELATION; PARTAL-SUM TRANSFORM;

HEURISTIC METHODS;

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

References (59)

1. T.S. Anantharaman, A statistical study of selective min-max search in computer chess, Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, University Report CMU-CS-90-173, 1990.
2. T.S. Anantharaman Evaluation tuning for computer chess: linear discriminant methods ICCA J. 20 4 1997 224 242
3. J. Baxter, A. Tridgell, L. Weaver, KNIGHTCAP: a chess program that learns by combining TD (λ ) with game-tree search, Proc. 15th Internat. Conf. in Machine Learning (IMCL), Madison, WI, 1998, pp. 28-36.
4. D.F. Beal, and M.C. Smith Learning piece values using temporal differences ICCA J. 20 3 1997 147 151
5. D.F. Beal, and M.C. Smith Learning piece-square values using temporal differences ICCA J. 22 4 1999 223 235
6. D.F. Beal, M.C. Smith, First results from using temporal difference learning in Shogi, in: H.J. van den Herik, H. Iida (Eds.), Computers and Games, Lecture Notes in Computer Science, Vol. 1558, Springer, Berlin, Germany, 1999, pp. 113-125.
7. M. Buro Statistical feature combination for the evaluation of game positions J. Artif. Intell. Res. 3 1995 373 382
8. M. Buro, From simple features to sophisticated evaluation functions, in: H.J. van den Herik, H. Iida (Eds.), Computers and Games, Lecture Notes in Computer Science, Vol. 1558, Springer, Berlin, Germany, 1999, pp. 126-145.
9. K. Chellapilla, and D. Fogel Evolving neural networks to play checkers without relying on expert knowledge IEEE Trans. Neural Networks 10 6 1999 1382 1391
10. K. Chellapilla, and D. Fogel Evolving a checkers player without relying on human experience IEEE Trans. Evolutionary Comput. 5 4 2001 422 428
11. N. Cliff Ordinal Methods for Behavioral Data Analysis 1996 Lawrence Erlbaum London
12. G. Elidan, M. Ninio, N. Friedman, and D. Schuurmans Data perturbation for escaping local maxima in learning Proc. AAAI 2002 Edmonton 2002 132 139
13. T.E. Fawcett, and P.E. Utgoff Automatic feature generation for problem solving systems Proc. Ninth Internat. Conf. Machine Learning Morgan Kaufman, Los Altos, CA 1992 144 153
14. J. Fürnkranz Machine learning in games: a survey J. Fürnkranz M. Kubat Machines that Learn to Play Games 2001 Nova Scientific Publishers New York 11 59 < ftp://ftp.ai.univie.ac.at/papers/oefai-tr-2000-31.pdf >
15. D. Gomboc, Tuning evaluation functions by maximizing concordance, M.Sc. Thesis, University of Alberta, Edmonton, Alberta, Canada, 2004 < http://www.cs.ualberta.ca/~games/papers/theses/gomboc_msc.pdf >.
16. D. Gomboc, T.A. Marsland, and M. Buro Ordinal correlation for evaluation function tuning H.J. van den Herik Advances in Computer Games: Many Games, Many Challenges 2003 Kluwer Academic Publishers Dordrecht 1 18
17. D. Hartmann How to extract relevant knowledge from grandmaster games, Part 1: grandmasters have insights - the problem is what to incorporate into practical programs ICCA J. 10 1 1987 14 36
18. D. Hartmann How to extract relevant knowledge from grandmaster games, Part 2: the notion of mobility, and the work of De Groot and Slater ICCA J. 10 2 1987 78 90
19. D. Hartmann Notions of evaluation functions tested against grandmaster games D.F. Beal Advances in Computer Chess 1989 Elsevier Science Publishers Amsterdam, The Netherlands 91 141
20. F.-H. Hsu, T.S. Anantharaman, M.S. Campbell, and A. Nowatzyk Deep thought T.A. Marsland J. Schaeffer Computers, Chess, and Cognition 1990 Springer Berlin 55 78
21. R.M. Hyatt, CRAFTY - chess program, 1996. < ftp://ftp.cis.uab.edu/pub/ hyatt/v19/crafty-19.1.tar.gz >.
22. T. Kaneko, K. Yamaguchi, and S. Kawai Automated identification of patterns in evaluation functions H.J. van den Herik Advances in Computer Games: Many Games, Many Challenges 2003 Kluwer Academic Publishers Dordrecht 279 298
23. G. Kendall, G. Whitwell, An evolutionary approach for the tuning of a chess evaluation function using population dynamics, Proc. 2001 IEEE Congr. on Evolutionary Computation, 2001, pp. 995-1002 < http://www.cs.nott.ac.uk/~gxk/ papers/cec2001chess.pdf >.
24. R. Levinson, R. Snyder, Adaptive Pattern-Oriented Chess, AAAI, 1991, pp. 601-606.
25. T.A. Marsland, Relative efficiency of alpha-beta implementations, IJCAI 1983, pp. 763-766.
26. T.A. Marsland Evaluation-function factors ICCA J. 8 2 1985 47 57
27. M. van der Meulen Weight assessment in evaluation functions D.F. Beal Advances in Computer Chess 5 1989 Elsevier Science Publishers Amsterdam, The Netherlands 81 90
28. P. Mysliwietz, Konstruktion und Optimierung von Bewertungstfunktionen beim Schach, Ph.D. Thesis, Universität Paderborn, Paderborn, Germany, 1994.
29. A. Nowatzyk, 2000 < http://www.tim-mann.org/deepthought.html >.
30. J. Nunn Der of Nunn-Test II Computer-Schach und Spiele 18 1 2000 30 35 < http://www.computerschach.de/test/nunn2.htm >
31. J. Nunn, G. Burgess, J. Emms, J. Gallagher, Nunn's Chess Openings, Everyman, 1999.
32. J. Nunn, F. Friedel, D. Steinwender, and C. Liebert Computer ohne Buch Computer-Schach und Spiele 16 1 1998 7 14
33. C. Pinchak, P. Lu, M. Goldenberg, Practical heterogeneous placeholder scheduling in overlay metacomputers: early experiences, Eighth Workshop on Job Scheduling Strategies for Parallel Processing, Edinburgh, Scotland, UK, 2002, pp. 85-105.
34. Reprinted in Lecture Notes in Computer Science, Vol. 2537, Springer, Berlin, 2003, pp. 205-228. < http://www.cs.ualberta.ca/~paullu/Trellis/ Papers/placeholders.jsspp.2002.ps.gz >.
35. A. Plaat, J. Schaeffer, W. Pijls, and A. de Bruin Best-first fixed-depth game-tree search in practice Artif. Intell. 87 1-2 1996 255 293
36. W. Press, S. Teukolsky, W. Vetterling, B. Flannery, Numerical Recipes in C: the Art of Scientific Computing, second ed., Cambridge University Press, Cambridge, 1992, pp. 644-645.
37. Sahovski Informator, Chess Informant, 1996. < http://www.sahovski.com/ >.
38. A.L. Samuel Some studies in machine learning using the game of checkers IBM J. Res. Develop. 3 1959 211 229
39. A.L. Samuel Some studies in machine learning using the game of checkers II - Recent progress IBM J. Res. Develop. 2 6 1967 601 617
40. W.S. Sarle, Measurement theory: frequently asked questions, version 3. < ftp://ftp.sas.com/pub/neural/measurement.html >. Revision of publication in Disseminations of the International Statistical Applications Institute, Vol. 1, ed. 4, 1995, pp. 61-66.
41. J. Schaeffer, M. Hlynka, V. Jussila, Temporal difference learning applied to a high-performance game-playing program, Proc. IJCAI 2001, 2001, pp. 529-534.
42. C.E. Shannon Programming a computer for playing chess Philos. Mag. 41 1950 256 275
43. S.S. Stevens On the theory of scales of measurement Science 103 1946 677 680
44. S.S. Stevens Mathematics, measurement, and psychophysics S.S. Stevens Handbook of Experimental Psychology 1951 Wiley New York 1 49
45. S.S. Stevens, Measurement, in: C.W. Churchman (Ed.), Measurement: Definitions and Theories, Wiley, New York, 1959, pp. 18-36.
46. Reprinted in: G.M. Maranell (Ed.), Scaling: A Sourcebook for Behavioral Scientists, Aldine, Chicago, 1974, pp. 22-41.
47. R.S. Sutton Learning to predict by the methods of temporal differences Mach. Learning 3 1988 9 44
48. G. Tesauro Connectionist learning of expert preferences by comparison training D. Touretzky Advances in Neural Information Processing Systems 1 1989 Morgan Kauffman Los Altos, CA 99 106
49. G. Tesauro, Temporal difference learning and TD-GAMMON, Comm. ACM 38 (3) (1995) 55-68. < http://www.research.ibm.com/massive/tdl.html >.
50. G. Tesauro Comparison training of chess evaluation functions J. Fürnkranz M. Kubat Machines that Learn to Play Games 2001 Nova Scientific Publishers New York 117 130
51. K. Thompson Computer chess strength M.R.B. Clarke Advances in Computer Chess 3 1982 Pergamon Press Oxford, UK 55 56
52. J.W. Tukey, The future of data analysis, in: L.V. Jones (Ed.), The Collected Works of John W. Tukey, Vol. 3, Wadsworth, Belmont, California, USA, 1986, pp. 391-484
53. P.E. Utgoff, ELF: an evaluation function learner that constructs its own features, Technical Report 96-65, Department of Computing Science, University of Massachusetts, Amherst, Massachusetts, USA, 1996.
54. P.E. Utgoff Feature construction for game playing J. Fürnkranz M. Kubat Machines that Learn to Play Games 2001 Nova Scientific Publishers New York 131 152
55. P.E. Utgoff, J.A. Clouse, Two kinds of training information for evaluation function learning, AAAI, 1991, pp. 596-600.
56. P.E. Utgoff, and D. Precup Constructive function approximation Motoda Liu Feature Extraction Construction and Selection a Data-Mining Perspective 1998 Kluwer Academic Publishers Dordrecht 219 235
57. P.E. Utgoff, D.J. Stracuzzi, Approximation via value unification, in: Proc. 16th Internat. Conf. Machine Learning (ICML), Morgan Kaufmann, Los Altos, CA, 1999, pp. 425-432.
58. P.E. Utgoff, and D.J. Stracuzzi Many-layered learning Neural Comput. 14 2002 2497 2539
59. P. Velleman, L. Wilkinson, Nominal, ordinal, interval, and ratio typologies are misleading. < http://www.spss.com/research/wilkinson/ Publications/Stevens.pdf >. A previous version appeared in Amer. Statist. 47 (1) (1993) 65-72.