1. Root evaluation errors;Althöfer;ICCA J.,1988
2. Null move and deep search;Donninger;ICCA J.,1993
3. R. Feldmann, Fail high reductions, in: J. van den Herik (Ed.), Advances in Computer Chess, Vol. 8, Universiteit Maastricht, Maastricht, 1996.
4. H. Kaindl, A. Scheucher, The reason for the benefits of minmax search, in: Proc. 11th IJCAI, Detroit, MI, 1989, pp. 322–327.
5. An analysis of alpha-beta pruning;Knuth;Artificial Intelligence,1975