Parallel controlled conspiracy number search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2400, Issue , 2002, Pages 420-430

  Lorenz, U ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER GAMES; LEARNING ALGORITHMS; PROGRAM PROCESSORS;

APPROXIMATION RESULTS; BOARD GAMES; CHESS PROGRAM; GAME TREE SEARCH; GAME TREES; SUBTREES; TREE SEARCH ALGORITHM; WORKSTATION CLUSTERS;

TREES (MATHEMATICS);

EID: 77953748508     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45706-2_57     Document Type: Conference Paper

References (14)

1. T.S. Anantharaman. Extension heuristics. ICCA Journal, 14(2):47–63, 1991.
2. C. Donninger. Null move and deep search. ICCA Journal, 16(3):137–143, 1993.
3. R. Feldmann. Fail high reductions. Advances in Computer Chess 8 (ed. J. van den Herik), 1996.
4. R. Feldmann, M. Mysliwietz, and B. Monien. Studying overheads in massively parallel min/max-tree evaluation. In 6th ACMAnnual symposium on parallel algorithms and architectures (SPAA’94), pages 94–104, New York, NY, 1994. ACM.
5. R.M. Karp and Y. Zhang. On parallel evaluation of game trees. In First ACMAnnual symposium on parallel algorithms and architectures (SPAA’89), pages 409–420, New York, NY, 1989. ACM.
6. D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293–326, 1975.
7. 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.
8. U. Lorenz. P.ConNers wins the 10th Grandmaster Tournament in Lippstadt. ICGA Journal, 23(3), 2000.
9. U. Lorenz. Parallel controlled conspiracy number search. In 13th ACMAnnual symposium on parallel algorithms and architectures (SPAA’01), pages 320–321, NY, 2001. ACM.
10. 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.
11. D.A. McAllester. Conspiracy Numbers for Min-Max searching. Artificial Intelligence, 35(1):287–310, 1988.
12. R.L. Rivest. Game tree searching by min/max approximation. Artificial Intelligence, 34(1):77–96, 1987.
13. 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.
14. J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43(1):67–84, 1990.