Abstract
Tree search algorithms play an important role in many applications in the field of artificial intelligence. When playing board games like chess etc., computers use game tree search algorithms to evaluate a position. In this paper, we present a procedure that we call Parallel Controlled Conspiracy Number Search (Parallel CCNS). Briefly, we describe the principles of the sequential CCNS algorithm, which bases its approximation results on irregular subtrees of the entire game tree. We have parallelized CCNS and implemented it in our chess program P.ConNerS, which now is the first in the world that could win a highly ranked Grandmaster chess-tournament. We add experiments that show a speedup of about 50 on 159 processors running on an SCI workstation cluster.
Supported by the German Science Foundation (DFG) project Efficient Algorithms For Discrete Problems And Their Applications
A short version of this paper was presented at the SPAA’01 revue [9].
Chapter PDF
Similar content being viewed by others
References
T.S. Anantharaman. Extension heuristics. ICCA Journal, 14(2):47–63, 1991.
C. Donninger. Null move and deep search. ICCA Journal, 16(3):137–143, 1993.
R. Feldmann. Fail high reductions. Advances in Computer Chess 8 (ed. J. van den Herik), 1996.
R. Feldmann, M. Mysliwietz, and B. Monien. Studying overheads in massively parallel min/max-tree evaluation. In 6th ACM Annual symposium on parallel algorithms and archi-tectures (SPAA’94), pages 94–104, New York, NY, 1994. ACM.
R.M. Karp and Y Zhang. On parallel evaluation of game trees. In First ACM Annual symposium on parallel algorithms and architectures (SPAA’89), pages 409–420, New York, NY, 1989. ACM.
D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293–326, 1975.
U. Lorenz. Controlled Conspiracy-2 Search. Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), (H. Reichel, S. Tison eds), Springer LNCS, pages 466–478, 2000.
U. Lorenz. P.ConNers wins the 10th Grandmaster Tournament in Lippstadt. ICGA Journal, 23(3), 2000.
U. Lorenz. Parallel controlled conspiracy number search. In 13th ACM Annual symposium on parallel algorithms and architectures (SPAA’01), pages 320–321, NY, 2001. ACM.
U. Lorenz and B. Monien. The secret of selective game tree search, when using random-error evaluations. Accepted for the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS) 2002, to appear.
D.A. McAllester. Conspiracy Numbers for Min-Max searching. Artificial Intelligence, 35(1):287–310, 1988.
R.L. Rivest. Game tree searching by min/max approximation. Artificial Intelligence, 34(1):77–96, 1987.
J.W. Romein, A. Plaat, H.E. Bal, and J. Schaeffer. Transposition Table Driven Work Scheduling in Distributed Search. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), pages 725–731, 1999.
J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43(1):67–84, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lorenz, U. (2002). Parallel Controlled Conspiracy Number Search. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_57
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive