1. T.S. Anantharaman, A statistical study of selective min–max search in computer chess, Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, University Report CMU-CS-90-173, 1990.
2. Evaluation tuning for computer chess: linear discriminant methods;Anantharaman;ICCA J.,1997
3. J. Baxter, A. Tridgell, L. Weaver, KNIGHTCAP: a chess program that learns by combining TD(λ) with game-tree search, Proc. 15th Internat. Conf. in Machine Learning (IMCL), Madison, WI, 1998, pp. 28–36.
4. Learning piece values using temporal differences;Beal;ICCA J.,1997
5. Learning piece-square values using temporal differences;Beal;ICCA J.,1999