How hard is the correct coding of an easy endgame
暂无分享，去创建一个
This paper concerns the correct coding of an endgame evaluation function to be used in a regular chess program (i.e. using a non modiied-search). After showing why it is necessary to implement such knowledge, it is shown how the author, a non chess expert, and a computer inductively learnt classiication concepts.
[1] T. Niblett,et al. AUTOMATIC INDUCTION OF CLASSIFICATION RULES FOR A CHESS ENDGAME , 1982 .
[2] H. J. van den Herik. Strategy in chess endgames , 1983 .
[3] Paul E. Utgoff,et al. ID5: An Incremental ID3 , 1987, ML.
[4] Wilhelm Barth,et al. Validating a Range of Endgame Programs , 1992, J. Int. Comput. Games Assoc..
[5] Walter Van de Velde. Incremental Induction of Topologically Minimal Trees , 1990, ML.