Skip to main content

From Simple Features to Sophisticated Evaluation Functions

  • Conference paper
  • First Online:
Computers and Games (CG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1558))

Included in the following conference series:

Abstract

This paper discusses a practical framework for the semi-automatic construction of evaluation-functions for games. Based on a structured evaluation function representation, a procedure for exploring the feature space is presented that is able to discover new features in a computationally feasible way. Besides the theoretical aspects, related practical issues such as the generation of training positions, feature selection, and weight fitting in large linear systems are discussed. Finally, we present experimental results for Othello, which demonstrate the potential of the described approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Buro. Experiments with Multi-Probcut and a new high-quality evaluation function for Othello. Workshop on Game-Tree Search, NEC Research Institute, 1997.

    Google Scholar 

  2. M. Buro. The Othello match of the year: Takeshi Murakami vs. Logistello. ICCA Journal, 20(3):189–193, 1997.

    Google Scholar 

  3. S.J. Hanson. Meiosis networks. Advances in Neural Information Processing Systems, pages 553–541, 1990.

    Google Scholar 

  4. F. Hsu, S. Anantharaman, M.S. Campbell, and A. Nowatzyk. Deep Thought. In T.A. Marsland and J. Schaeffer, editors, Computer, Chess, and Cognition, pages 55–78. Springer Verlag, 1990.

    Google Scholar 

  5. R.A. Levinson and R. Snyder. Adaptive pattern-oriented chess. In L. Birnbaum and G. Collins, editors, Proceedings of the 8th International Workshop on Machine Learning, pages 85–89, 1991.

    Google Scholar 

  6. W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery. Numerical Recipes, 2nd edition. Cambridge University Press, 1992.

    Google Scholar 

  7. A.L. Samuel. Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3(3):211–229, 1959.

    Article  MathSciNet  Google Scholar 

  8. G. Tesauro. TD-Gammon, a self-teaching backgammon program, reaches master-level play. Neural Computation, 6(2):215–219, 1994.

    Article  Google Scholar 

  9. G. Tesauro. Temporal difference learning and TD-Gammon. Communications of the ACM, 38(3):58–68, 1995.

    Article  Google Scholar 

  10. P.E. Utgoff. Constructive function approximation. Technical Report 97-4, Univ. of Mass., 1997.

    Google Scholar 

  11. M. Wynne-Jones. Node splitting: A constructive algorithm for feed-forward neural networks. Neural Computing and Applications, 1(1):17–22, 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buro, M. (1999). From Simple Features to Sophisticated Evaluation Functions. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48957-6_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65766-8

  • Online ISBN: 978-3-540-48957-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics