Advertisement

Automatic Construction of Static Evaluation Functions for Computer Game Players

  • Makoto Miwa
  • Daisaku Yokoyama
  • Takashi Chikayama
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4265)

Abstract

Constructing evaluation functions with high accuracy is one of the critical factors in computer game players. This construction is usually done by hand, and deep knowledge of the game and much time to tune them are needed for the construction. To avoid these difficulties, automatic construction of the functions is useful. In this paper, we propose a new method to generate features for evaluation functions automatically based on game records. Evaluation features are built on simple features based on their frequency and mutual information. As an evaluation, we constructed evaluation functions for mate problems in shogi. The evaluation function automatically generated with several thousand evaluation features showed the accuracy of 74% in classifying positions into mate and non-mate.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tesauro, G.: TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Comput. 6(2), 215–219 (1994)CrossRefGoogle Scholar
  2. 2.
    Buro, M.: From simple features to sophisticated evaluation functions. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol. 1558, pp. 126–145. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  3. 3.
    Kaneko, T., Yamaguchi, K., Kawai, S.: Automated Identification of Patterns in Evaluation Functions. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games, vol. 10, pp. 279–298. Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  4. 4.
    Fleuret, F.: Fast Binary Feature Selection with Conditional Mutual Information. JMLR 5, 1531–1555 (2004)MathSciNetGoogle Scholar
  5. 5.
    Baxter, J., Tridgell, A., Weaver, L.: Learning to Play Chess Using Temporal Differences. Machine Learning 40(3), 243–263 (2000)zbMATHCrossRefGoogle Scholar
  6. 6.
    Gomboc, D., Marsland, T.A., Buro, M.: Evaluation fuction tuning via ordinal correlation. In: van den Herik, Iida, Heinz (eds.) Advances in Computer Games, pp. 1–18. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
  7. 7.
    Fayyad, U.M., Keki, B.: Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. In: IJCAI 1993, pp. 1022–1027 (1993)Google Scholar
  8. 8.
    Uno, T., Kiyomi, M., Arimura, H.: Lcm ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Proc. of the 1st international workshop on open source data mining, New York, USA, pp. 77–86. ACM Press, New York (2005)CrossRefGoogle Scholar
  9. 9.
    Sakuta, M., Iida, H.: And/or-tree search algorithms in shogi mating search. ICGA Journal 24(4), 218–229 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Makoto Miwa
    • 1
  • Daisaku Yokoyama
    • 1
  • Takashi Chikayama
    • 1
  1. 1.Graduate School of Frontier Sciencesthe University of TokyoChibaJapan

Personalised recommendations