1. J. Baxter, A. Tridgell, L. Weaver, KnightCap: A chess program that learns by combining TD(lambda) with game-tree search, in: Machine Learning, Proceedings of the 15th International Conference, ICML ’98, Madison, 1998, pp. 28–36.
2. D.F. Beal, Experiments with the Null Move, in: D.F. Beal (Ed.), Advances in Computer Chess 5, Elsevier, Amsterdam, 1989, pp. 65–79.
3. Learning piece values using temporal differences;Beal;Internat. Comp. Chess Ass. J.,1997
4. J. Christensen, R. Korf, A unified theory of heuristic evaluation functions and its application to learning, AAAI-86, Morgan-Kaufman, Los Altos, CA, 1986, pp. 148–152.
5. Null move and deep search;Donninger;Internat. Comp. Chess Ass. J.,1993