This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search
September 1988 (vol. 10 no. 5)
pp. 687-694

A parallel alpha-beta search algorithm called unsynchronized iteratively deepening parallel alpha-beta search is described. The algorithm's simple control strategy and strong performance in complicated positions make it a viable alternative to the principal variation splitting algorithm (PVSA). Processors independently carry out iteratively deepening searches on separate subsets of moves. The iterative deepening is unsynchronized, e.g. one processor may be in the middle of the fifth iteration while another is in the middle of the sixth. Narrow windows diminish the importance of backing-up a score to the root of the tree as quickly as possible (one of the principal objectives of the PVSA). Speedups measured on one, two, four, and eight chess-playing computers are reported.

[1] R. M. Hyatt, "Parallel search on the Cray X-MP/48,"ICCA J., vol. 8, no. 2, pp. 90-99, June 1985.
[2] T. A. Marsland, M. Olafsson, and J. Schaeffer, "Multiprocessor tree-search experiments," inAdvances in Computer Chess 4, D. Beal, Ed. Oxford, UK: Pergamon, 1985, pp. 37-51.
[3] T. A. Marsland and M. S. Campbell, "Parallel search of strongly ordered game trees,"ACM Comput. Surv., vol. 14, no. 4, pp. 533-552, 1982.
[4] J. Schaeffer, "Improved parallel alpha-beta search," inProc. 1986 Fall Joint Comput. Conf., Nov. 1986, pp. 519-527.
[5] M. Newborn, "Ostrich/P--A parallel search chess program," School Comput. Sci., McGill Univ., Montreal, P.Q., Canada, Tech. Rep, SOCS-82.3, Mar. 1982.
[6] M. Newborn, "A parallel search chess program," inProc. 1985 ACM Annu. Conf., Oct. 1985, pp. 272-277.
[7] T. A. Marsland and F. Popowich, "Parallel game-tree search,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-7, pp. 442-452, July 1985.
[8] R. Finkel and J. Fishburn, "Parallelism in alpha-beta search,"Artif. Intell., vol. 19, pp. 89-106, 1982.
[9] S. G. Akl, D. T. Barnard, and R. J. Doran, "Design, analysis, and implementation of a parallel tree-search algorithm,"IEEE Trans. Pattern Anal. Mach. Intell., pp. 192-203, 1982.
[10] G. M. Baudet, "The design and analysis of algorithms for asynchronous multiprocessors," Carnegie-Mellon Univ., Pittsburgh, PA, CMU-CS-78-116, Apr. 1978.
[11] J. H. Condon and K. Thompson, "Belle chess hardware," inAdvances in Computer Chess 3, M. R. B. Clarke, Ed. Oxford, UK: Pergamon, 1982, pp. 45-54.
[12] T. Scherzer, "Hardware move generation in chess playing computers utilizing multiport memory and pipeline processing," unpublished manuscript, 1985.
[13] H. J. Berliner, "Computer chess at Carnegie-Mellon University," inAdvances in Computer Chess 4, D. Beal, Ed. Oxford, UK: Pergamon, 1986, pp. 166-180.
[14] H. Berliner and C. Ebeling, "The SUPREM architecture: A new intelligent paradigm,"Artif. Intell., vol. 28, pp. 3-8, 1986.
[15] M. Newborn, "Recent progress in computer chess," inAdvances in Computers 19, M. Yovitz, Ed. New York: Academic, 1979, pp. 58-118.
[16] J. H. Condon and K. Thompson, "Belle," inChess Skill in Man and Machine, 2nd ed., P. Frey, Ed. New York: Springer-Vertag, 1983, pp. 201-210.
[17] M. Newborn, "An hypothesis concerning the strength of chess programs,"ICCA J., vol. 8, no. 4, pp. 209-215, Jan. 1986.
[18] D. Knuth and R. Moore, "An analysis of alpha-beta pruning,"Artif. Intell., vol. 6, pp. 293-326, 1975.
[19] D. J. Slate and L. R. Atkin, "CHESS 4.5--The Northwestern University chess program," inChess Skill in Man and Machine, P. Frey, Ed. New York: Springer-Verlag, 1977, pp. 82-118.
[20] R. E. Korf, "Iteratively-Deepening-A*: An optimal admissible tree search," inProc. Ninth Int. Joint Conf. Artif. Intell., Los Angeles, CA, Aug. 1985, pp. 1034-1036.
[21] M. E. Stickel and W. M. Tyson, "An analysis of consecutively bounded depth-first search with applications in automated deduction," inProc. Ninth Int. Joint Conf. Artif. Intell., Los Angeles, CA, Aug. 1985, pp. 1073-1075.
[22] J. Pearl, "Asymptotic properties of minimax trees and searching procedures,"Artif. Intell., vol. 14, pp. 113-138, 1980.
[23] J. P. Fishburn, "Analysis of speedup in distributed algorithms," Univ. Wisconsin, Madison, WI, Tech. Rep. 431, May 1981.
[24] A. Reinefeld, J. Schaeffer, and T. Marsland, "Information acquisition in minimal window search," inProc. Ninth Int. Joint Conf. Artif. Intell., Los Angeles, CA, Aug. 1985, pp. 1040-1043.
[25] R. M. Hyatt, "Using time wisely,"ICCA J., vol. 7, no. 1, pp. 4-9, Mar. 1984.
[26] I. Bratko and D. Kopec, "A test for comparison of human and computer performance in chess," inAdvances in Computer Chess 3, M. R. B. Clarke, Ed. Oxford, UK: Pergamon, 1982, pp. 31-56.

Index Terms:
unsynchronized iterative deepening search; parallel alpha-beta search algorithm; principal variation splitting algorithm; tree; iterative methods; parallel algorithms; search problems; trees (mathematics)
Citation:
M. Newborn, "Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 687-694, Sept. 1988, doi:10.1109/34.6777
Usage of this product signifies your acceptance of the Terms of Use.