Feature construction for game playing

To build an evaluation function for game-playing, one needs to construct informative features that enable accurate relative assessment of a game state. This chapter describes the feature construction problem, and suggests directions for dealing with shortcomings in the present state of the art.

[1]  David M. Skapura,et al.  Neural networks - algorithms, applications, and programming techniques , 1991, Computation and neural systems series.

[2]  Hiroshi Motoda,et al.  Feature Extraction, Construction and Selection: A Data Mining Perspective , 1998 .

[3]  Berliner,et al.  Search vs. knowledge : an analysis from the domain of games , 1981 .

[4]  Michael Buro,et al.  From Simple Features to Sophisticated Evaluation Functions , 1998, Computers and Games.

[5]  Arthur L. Samuel,et al.  Some studies in machine learning using the game of checkers , 2000, IBM J. Res. Dev..

[6]  Paul E. Utgoff,et al.  Two Kinds of Training Information For Evaluation Function Learning , 1991, AAAI.

[7]  Richard O. Duda,et al.  Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant Functions , 1966, IEEE Trans. Electron. Comput..

[8]  Richard Waldinger,et al.  Achieving several goals simultaneously , 1977 .

[9]  Rich Caruana,et al.  Multitask Learning , 1998, Encyclopedia of Machine Learning and Data Mining.

[10]  Sanjoy Mahajan,et al.  A Pattern Classification Approach to Evaluation Function Learning , 1988, Artif. Intell..

[11]  Marcus Frean,et al.  The Upstart Algorithm: A Method for Constructing and Training Feedforward Neural Networks , 1990, Neural Computation.

[12]  Paul E. Utgoff,et al.  Approximation Via Value Unification , 1999, ICML.

[13]  Christian Lebiere,et al.  The Cascade-Correlation Learning Architecture , 1989, NIPS.

[14]  Gerald Tesauro,et al.  Practical Issues in Temporal Difference Learning , 1992, Mach. Learn..

[15]  E. Feigenbaum,et al.  Computers and Thought , 1963 .

[16]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[17]  Tom Elliott Fawcett.  Feature discovery for problem solving systems , 1993 .

[18]  Steven C. Suddarth,et al.  Symbolic-Neural Systems and the Use of Hints for Developing Complex Systems , 1991, Int. J. Man Mach. Stud..

[19]  Doina Precup,et al.  Constructive Function Approximation , 1998 .

[20]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[21]  Stephen Jose Hanson,et al.  Meiosis Networks , 1989, NIPS.

[22]  Paul E. Utgoff,et al.  Perceptron Trees : A Case Study in ybrid Concept epresentations , 1999 .

[23]  James Patrick Callan,et al.  Knowledge-based feature generation for inductive learning , 1993 .

[24]  Hans J. Berliner,et al.  The B* Tree Search Algorithm: A Best-First Proof Procedure , 1979, Artif. Intell..

[25]  Paul S. Rosenbloom,et al.  A World-Championship-Level Othello Program , 1982, Artif. Intell..

[26]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[27]  Robert Levinson,et al.  Adaptive Pattern-Oriented Chess , 1991, AAAI Conference on Artificial Intelligence.

[28]  Timur Ash,et al.  Dynamic node creation in backpropagation networks , 1989 .

[29]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .