The secret of selective game tree search, when using random-error evaluations

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

Volumn 2285, Issue , 2002, Pages 203-214

  Lorenz, U ^a   Monien, B ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SUPERCOMPUTERS; TREES (MATHEMATICS);

AVERAGE-CASE ANALYSIS; COMBINATORIAL MODELING; COMPUTER CHESS; ERROR EVALUATION; GAME TREE SEARCH; GAME-PLAYING PROGRAMS; HEURISTIC EVALUATION FUNCTIONS; TWO-PERSON ZERO-SUM GAME;

COMPUTER GAMES;

EID: 84937424733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_16     Document Type: Conference Paper

References (14)

1. I. Althöfer. Root evaluation errors: How they arise and propagate. ICCA Journal, 11(3):55–63, 1988.
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. H. Kaindl and A. Scheucher. The reason for the benefits of minmax search. In Proc. of the 11 th IJCAI, pages 322–327, Detroit, MI, 1989.
5. D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293–326, 1975.
6. 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.
7. U. Lorenz and P. ConNers wins the 10th Grandmaster Tournament in Lippstadt. ICCA Journal, 23(3):188–192, 2000.
8. U. Lorenz. Parallel controlled conspiracy number search. Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, pages 320–321, 2001.
9. D.A. McAllester. Conspiracy Numbers for Min-Max searching. Artificial Intelligence, 35(1):287–310, 1988.
10. D.S. Nau. Quality of Decision versus depth of search on game trees. PhD thesis, Duke University, Durham, NC, 1979.
11. J. Pearl. On the nature of pathology in game searching. Artificial Intelligence, 20(4):427–453, 1983.
12. J. Pearl. Heuristics – Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Co., Reading, MA, 1984.
13. J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43(1):67–84, 1990.
14. J. Schaeffer and A. Plaat. Kasparov versus Deep Blue: The Rematch. ICCA Journal, 20(2):95–125, 1997.