SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

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

Volumn 1770, Issue , 2000, Pages 466-478

Controlled conspiracy-2 search

(1) Lorenz, Ulf a

a UNIVERSITY OF PADERBORN (Germany)

Author keywords

Algorithms and datastructures

Indexed keywords

SUPERCOMPUTERS; TREES (MATHEMATICS);

ALPHA-BETA; BOARD GAMES; CHESS PROGRAM; COMPUTER CHESS; GAME TREE SEARCH; GAME TREES; SUB TREES; TIME BEHAVIOR;

COMPUTER GAMES;

EID: 84944073403 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-46541-3_39 Document Type: Conference Paper

Times cited : (10)

References (19)

1
- 12444265250
- A minimax Algorithm better than SSS*
- A. de Bruin, A. Plaat, J. Schaeffer and W. Pijls. A minimax Algorithm better than SSS*. Artificial Intelligence, 87:255-293, 1999.
- (1999) Artificial Intelligence , vol.87 , pp. 255-293
- De Bruin, A.¹ Plaat, A.² Schaeffer, J.³ Pijls, W.⁴

2
- 12444288921
- Extension heuristics
- T.S. Anantharaman. Extension heuristics. ICCA Journal, 14(2):47-63, 1991.
- (1991) ICCA Journal , vol.14 , Issue.2 , pp. 47-63
- Anantharaman, T.S.¹

3
- 0002835824
- Experiments with the null move
- (ed. Beal, D.F.)
- D.F. Beal. Experiments with the null move. Advances in Computer Chess 5 (ed. Beal, D.F.), pages 65-79, 1989.
- (1989) Advances in Computer Chess 5 , pp. 65-79
- Beal, D.F.¹

4
- 84944087713
- Der neue Bednorz-Tönissen-Test
- H. Bednorz and F. Tönissen. Der neue Bednorz-Tönissen-Test. Computer Schach und Spiele, 11(2):24-27, 1994.
- (1994) Computer Schach Und Spiele , vol.11 , Issue.2 , pp. 24-27
- Bednorz, H.¹ Tönissen, F.²

5
- 0018466321
- The B* tree search algorithm: A best-first proof procedure
- H. Berliner. The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence, 12(1):23-40, 1979.
- (1979) Artificial Intelligence , vol.12 , Issue.1 , pp. 23-40
- Berliner, H.¹

6
- 0004456651
- Null move and deep search
- C. Donninger. Null move and deep search. ICCA Journal, 16(3):137-143, 1993.
- (1993) ICCA Journal , vol.16 , Issue.3 , pp. 137-143
- Donninger, C.¹

7
- 0842283662
- Fail high reductions
- (ed. J. van den Herik)
- R. Feldmann. Fail high reductions. Advances in Computer Chess 8 (ed. J. van den Herik), 1996.
- (1996) Advances in Computer Chess 8
- Feldmann, R.¹

8
- 0016622115
- An analysis of alpha-beta pruning
- D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intel- ligence, 6(4):293-326, 1975.
- (1975) Artificial Intel- Ligence , vol.6 , Issue.4 , pp. 293-326
- Knuth, D.E.¹ Moore, R.W.²

9
- 84944087714
- Technical report, University of Paderborn
- U. Lorenz. Controlled conspiracy-2 search. Technical report, University of Paderborn, available via http://www.upb.de/cs/agmonien/ PERSONAL/FLULO/publications.html, 1999.
- (1999) Controlled Conspiracy-2 Search
- Lorenz, U.¹

10
- 84944087715
- Technical report, University of Paderborn
- U. Lorenz and B. Monien. The secret of selective game tree search, when using random-error evaluations. Technical report, University of Paderborn, available via http://www.upb.de/cs/ag-monien/PERSONAL/FLULO/publications.html, 1998.
- (1998) The Secret of Selective Game Tree Search, When Using Random-Error Evaluations
- Lorenz, U.¹ Monien, B.²

11
- 77956720001
- Controlled conspiracy number search
- U. Lorenz, V. Rottmann, R. Feldmann, and P. Mysliwietz. Controlled conspiracy number search. ICCA Journal, 18(3):135-147, 1995.
- (1995) ICCA Journal , vol.18 , Issue.3 , pp. 135-147
- Lorenz, U.¹ Rottmann, V.² Feldmann, R.³ Mysliwietz, P.⁴

12
- 0023294104
- Low overhead alternatives to SSS*
- T.A. Marsland, A. Reinefeld, and J. Schaeffer. Low overhead alternatives to SSS*. Artificial Intelligence, 31(1):185-199, 1987.
- (1987) Artificial Intelligence , vol.31 , Issue.1 , pp. 185-199
- Marsland, T.A.¹ Reinefeld, A.² Schaeffer, J.³

13
- 0024048270
- Conspiracy Numbers for Min-Max searching
- D.A. McAllester. Conspiracy Numbers for Min-Max searching. Artificial Intelli- gence, 35(1):287-310, 1988.
- (1988) Artificial Intelli- Gence , vol.35 , Issue.1 , pp. 287-310
- McAllester, D.A.¹

14
- 0004234028
- A.J. Palay. Searching with Probabilities. 1985.
- (1985) Searching with Probabilities
- Palay, A.J.¹

15
- 0003961852
- Addison-Wesley Publishing Co., Reading, MA
- J. Pearl. Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Co., Reading, MA, 1984.
- (1984) Heuristics - Intelligent Search Strategies for Computer Problem Solving
- Pearl, J.¹

16
- 0023860583
- Game tree searching by min/max approximation
- R.L. Rivest. Game tree searching by min/max approximation. Artificial Intelli- gence, 34(1):77-96, 1987.
- (1987) Artificial Intelli- Gence , vol.34 , Issue.1 , pp. 77-96
- Rivest, R.L.¹

17
- 12244309343
- The history heuristic
- J. Schaeffer. The history heuristic. ICCA Journal, 6(3):16-19, 1983.
- (1983) ICCA Journal , vol.6 , Issue.3 , pp. 16-19
- Schaeffer, J.¹

18
- 0025414410
- Conspiracy numbers
- J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43(1):67-84, 1990.
- (1990) Artificial Intelligence , vol.43 , Issue.1 , pp. 67-84
- Schaeffer, J.¹

19
- 0018504934
- A minimax algorithm better than alpha-beta
- G.C. Stockman. A minimax algorithm better than alpha-beta? Artificial Intelli- gence, 12(2):179-196, 1979.
- (1979) Artificial Intelli- Gence , vol.12 , Issue.2 , pp. 179-196
- Stockman, G.C.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.