1. H. Bal. Heuristic search in PARLOG using replicated worker style parallelism. Future Generation Computer Systems, 6:303–315, 1991.
2. N. Carriero and D. Gelernter. How to Write Parallel Programs: A First Course. MIT Press, Cambridge, MA, 1990.
3. C.Ebeling. All the Right Moves: A VLSI Architecture for Chess. MIT Press, 1986.
4. P. Ciancarini. A Comparison of Parallel Search Algorithms based on Tree Splitting. Technical Report UBLCS-94-14, Comp. Science Laboratory, Università di Bologna, Italy, May 1994.
5. F. Hsu. Large scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, Feb 1990.