Abstract
Heuristic search effectiveness depends directly upon the quality of heuristic evaluations of states in the search space. We show why ordinal correlation is relevant to heuristic search, present a metric for assessing the quality of a static evaluation function, and apply it to learn feature weights for a computer chess program.
Chapter PDF
Similar content being viewed by others
Keywords
References
Baxter, J., Tridgell, A., and Weaver, L. (1998). KnightCap: A Chess Program that Learns by Combining TD(k) with Game-tree Search. Proceedings of the Fifteenth International Conference in Machine Learning (IMCL) pp. 28–36, Madison, WI.
Beal, D. F. and Smith, M. C. (1997). Learning Piece Values Using Temporal Differences. ICCA Journal, Vol. 20, No. 3, pp. 147–151.
Beal, D. F. and Smith, M. C. (1999a). Learning Piece-Square Values using Temporal Differences. ICCA Journal, Vol. 22, No. 4, pp. 223–235.
Beal, D. E. and Smith, M. C. (1999b). First Results from Using Temporal Difference Learning in Shogi. Computers and Games (eds. H.J. van den Herik and H. lida), pp. 113–125. Lecture Notes in Computer Science 1558, Springer-Verlag, Berlin, Germany.
Buro, M. (1995). Statistical Feature Combination for the Evaluation of Game Positions. Journal of Artificial Intelligence Research 3, pp. 373–382, Morgan Kaufmann, San Fransisco, CA.
Buro, M. (1999). From Simple Features to Sophisticated Evaluation Functions. Computers and Games (eds. H.J. van den Herik and H. Iida), pp. 126–145. Lecture Notes in Computer Science 1558, Springer-Verlag, Berlin, Germany.
Cliff, N. (1996). Ordinal Methods for Behavioral Data Analysis. Lawrence Erlbaum Associates.
Elidan, G, Ninio, M., Friedman, N., and Schuurmans, D. (2002). Data Perturbation for Escaping Local Maxima in Learning. AAAI 2002, pp. 132–139.
Hartmann, D. (1989). Notions of Evaluation Functions tested against Grandmaster Games. Advances in Computer Chess 5 (ed. D.F. Beal), pp. 91–141, Elsevier Science Publishers, Amsterdam, The Netherlands.
Hyatt, R.M. (1996). CRAFTY — Chess Program. ftps://ftp.cis.uab.edu/pub/hyatt/v19/crafty 19.1.tar.gz.
Kendall, G and Whitwell, G (2001). An Evolutionary Approach for the Tuning of a Chess Evaluation Function. Proceedings of the 2001 IEEE Congress on Evolutionary Computation. http://www.cs.nott.ac.uk/—gxk/papers/cec2001chess.pdf.
Marsland, T. A. (1983). Relative Efficiency of Alpha-beta Implementations. MCA’ 1983, pp. 763–766.
Nunn, J. (1999). http://www.computerschach.de/test/nunn2.html.
Nowatzyk, A. (2000). http://www.tim-mann.org/deepthought.html. Also, see publications by Anantharaman et al. (1987) and Hsu et al. (1988).
Pinchak, C., Lu, P., and Goldenberg, M. (2002). Practical Heterogeneous Placeholder Scheduling in Overlay Metacomputers: Early Experiences. 8th Workshop on Job Scheduling Strategies for Parallel Processing,Edinburgh, Scotland, U.K., pp. 85–105, also to appear in LNCS 2537 (2003), pp. 205–228, also at http://www.cs.ualberta.ca/.paullu/Trellis/Papers/placeholders.j sspp.2002.ps.gz.
Plaat, A., Schaeffer, J., Pijls, W., and Bruin, A. de (1996). Best-First Fixed-Depth Game-Tree Search in Practice. Artificial Intelligence, Vol. 87, Nos. 1–2, pp. 255–293.
Shannon, C. E. (1950). Programming a Computer for Playing Chess. Philosophical Magazine, Vol. 41, pp. 256–275.
Sahovski Informator (1966). Chess Informant: http://www.sahovski.com/.
Samuel, A. L. (1959). Some Studies in Machine Learning Using the Game of Checkers. IBM Journal of Research and Development, No. 3, pp. 211–229.
Samuel, A. L. (1967). Some Studies in Machine Learning Using the Game of Checkers. II — Recent Progress. IBM Journal of Research and Development, Vol. 2, No. 6, pp. 601–617. Sutton, R. S. (1988). Learning to Predict by the Methods of Temporal Differences. Machine Learning, Vol. 3, pp. 9–44.
Tesauro, G (1995). Temporal Difference Learning and TD-Gammon. Communications of the ACM,Vol. 38, No. 3, pp. 55–68. http://www.research.ibm.com/massive/tdl.html. Thompson, K. (1982). Computer Chess Strength. Advances in Computer Chess 3,(ed. M.R.B. Clarke), pp. 55–56. Pergamon Press, Oxford, UK.
Thompson, K. (1986). Retrograde Analysis of Certain Endgames. ICCA Journal, Vol. 9, No. 3, pp. 131–139.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Gomboc, D., Marsland, T.A., Buro, M. (2004). Evaluation Function Tuning via Ordinal Correlation. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds) Advances in Computer Games. IFIP — The International Federation for Information Processing, vol 135. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35706-5_1
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive