
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Newborn, "Unsynchronized Iteratively Deepening Parallel AlphaBeta Search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 687694, September, 1988.  
BibTex  x  
@article{ 10.1109/34.6777, author = {M. Newborn}, title = {Unsynchronized Iteratively Deepening Parallel AlphaBeta Search}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {10}, number = {5}, issn = {01628828}, year = {1988}, pages = {687694}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.6777}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Unsynchronized Iteratively Deepening Parallel AlphaBeta Search IS  5 SN  01628828 SP687 EP694 EPD  687694 A1  M. Newborn, PY  1988 KW  unsynchronized iterative deepening search; parallel alphabeta search algorithm; principal variation splitting algorithm; tree; iterative methods; parallel algorithms; search problems; trees (mathematics) VL  10 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
A parallel alphabeta search algorithm called unsynchronized iteratively deepening parallel alphabeta 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 backingup 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 chessplaying computers are reported.
[1] R. M. Hyatt, "Parallel search on the Cray XMP/48,"ICCA J., vol. 8, no. 2, pp. 9099, June 1985.
[2] T. A. Marsland, M. Olafsson, and J. Schaeffer, "Multiprocessor treesearch experiments," inAdvances in Computer Chess 4, D. Beal, Ed. Oxford, UK: Pergamon, 1985, pp. 3751.
[3] T. A. Marsland and M. S. Campbell, "Parallel search of strongly ordered game trees,"ACM Comput. Surv., vol. 14, no. 4, pp. 533552, 1982.
[4] J. Schaeffer, "Improved parallel alphabeta search," inProc. 1986 Fall Joint Comput. Conf., Nov. 1986, pp. 519527.
[5] M. Newborn, "Ostrich/PA parallel search chess program," School Comput. Sci., McGill Univ., Montreal, P.Q., Canada, Tech. Rep, SOCS82.3, Mar. 1982.
[6] M. Newborn, "A parallel search chess program," inProc. 1985 ACM Annu. Conf., Oct. 1985, pp. 272277.
[7] T. A. Marsland and F. Popowich, "Parallel gametree search,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI7, pp. 442452, July 1985.
[8] R. Finkel and J. Fishburn, "Parallelism in alphabeta search,"Artif. Intell., vol. 19, pp. 89106, 1982.
[9] S. G. Akl, D. T. Barnard, and R. J. Doran, "Design, analysis, and implementation of a parallel treesearch algorithm,"IEEE Trans. Pattern Anal. Mach. Intell., pp. 192203, 1982.
[10] G. M. Baudet, "The design and analysis of algorithms for asynchronous multiprocessors," CarnegieMellon Univ., Pittsburgh, PA, CMUCS78116, 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. 4554.
[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 CarnegieMellon University," inAdvances in Computer Chess 4, D. Beal, Ed. Oxford, UK: Pergamon, 1986, pp. 166180.
[14] H. Berliner and C. Ebeling, "The SUPREM architecture: A new intelligent paradigm,"Artif. Intell., vol. 28, pp. 38, 1986.
[15] M. Newborn, "Recent progress in computer chess," inAdvances in Computers 19, M. Yovitz, Ed. New York: Academic, 1979, pp. 58118.
[16] J. H. Condon and K. Thompson, "Belle," inChess Skill in Man and Machine, 2nd ed., P. Frey, Ed. New York: SpringerVertag, 1983, pp. 201210.
[17] M. Newborn, "An hypothesis concerning the strength of chess programs,"ICCA J., vol. 8, no. 4, pp. 209215, Jan. 1986.
[18] D. Knuth and R. Moore, "An analysis of alphabeta pruning,"Artif. Intell., vol. 6, pp. 293326, 1975.
[19] D. J. Slate and L. R. Atkin, "CHESS 4.5The Northwestern University chess program," inChess Skill in Man and Machine, P. Frey, Ed. New York: SpringerVerlag, 1977, pp. 82118.
[20] R. E. Korf, "IterativelyDeepeningA*: An optimal admissible tree search," inProc. Ninth Int. Joint Conf. Artif. Intell., Los Angeles, CA, Aug. 1985, pp. 10341036.
[21] M. E. Stickel and W. M. Tyson, "An analysis of consecutively bounded depthfirst search with applications in automated deduction," inProc. Ninth Int. Joint Conf. Artif. Intell., Los Angeles, CA, Aug. 1985, pp. 10731075.
[22] J. Pearl, "Asymptotic properties of minimax trees and searching procedures,"Artif. Intell., vol. 14, pp. 113138, 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. 10401043.
[25] R. M. Hyatt, "Using time wisely,"ICCA J., vol. 7, no. 1, pp. 49, 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. 3156.