1. A statistical study of selective min-max search in computer chess;Anantharaman,1990
2. Singular extensions: adding selectivity to brute force searching;Anantharaman,1988
3. Some necessary conditions for a Master chess program;Berliner,1973
4. Chess as problem solving: the development of a tactics analyzer;Berliner,1974
5. The B∗ tree search algorithm: a best-first proof procedure;Berliner;Artif. Intell.,1979