1. Abramson, B., “A Cure for Pathological Behavior in Games that Use Minimax,” First Workshop on Uncertainty and Probability in AI (1985).
2. Ballard, B. W., “Non-Minimax Search Strategies for Minimax Trees: Theoretical Foundations and Empirical Studies,” Tech. Report, Diíke University, (July 1983).
3. Chi, P. and Nau, D. S., “Predicting the Performance of Minimax and Product in Game Tree Searching,” Second Workshop on Uncertainty and Probability in AI (1986).
4. Fuller, S. H., Gaschnig, J. G., Gillogly, J. J. “An analysis of the alpha-beta pruning algorithm,” Dept. of Computer Science Report, Carnegie-Mellon University (1973).
5. Hasagawa, G., How to Win at Othello, Jove Publications, Inc., New York (1977).