1. Akl, S.G., Newborn, M.M.: The principal continuation and the killer heuristic. In: Proceedings of the 5th Annual ACM Computer Science Conference, pp. 466–473. ACM Press, Seattle (1977)
2. Anantharaman, T.S.: Extension heuristics. ICCA Journal 14(2), 47–65 (1991)
3. Beal, D.F.: Experiments with the null move. In: Beal, D.F. (ed.) Advances in Computer Chess 5, pp. 65–79. Elsevier Science Publishers, Amsterdam (1989)
4. Beal, D.F., Smith, M.C.: Quantification of search extension benefits. ICCA Journal 18(4), 205–218 (1995)
5. Berliner, H.J.: Chess as Problem Solving: The Development of a Tactics Analyzer. Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA (1974)