메뉴 건너뛰기




Volumn 82, Issue 1-2, 1996, Pages 237-257

Searching game trees under a partial order

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; SET THEORY; TREES (MATHEMATICS); VECTORS;

EID: 0030122831     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00085-9     Document Type: Article
Times cited : (8)

References (6)
  • 1
    • 0016622115 scopus 로고
    • An analysis of alpha-beta pruning
    • D.E. Knuth and R.W. Moore, An analysis of alpha-beta pruning, Artif. Intell. 6 (1975) 293-326.
    • (1975) Artif. Intell. , vol.6 , pp. 293-326
    • Knuth, D.E.1    Moore, R.W.2
  • 2
    • 0026103389 scopus 로고
    • Multi-player alpha-beta pruning
    • R.E. Korf, Multi-player alpha-beta pruning, Artif. Intell. 48 (1991) 99-111.
    • (1991) Artif. Intell. , vol.48 , pp. 99-111
    • Korf, R.E.1
  • 4
    • 0004286550 scopus 로고
    • Addison-Wesley, Reading, MA
    • J. Pearl, Heuristics (Addison-Wesley, Reading, MA 1984).
    • (1984) Heuristics
    • Pearl, J.1
  • 5
    • 0000251307 scopus 로고
    • Multiobjective A*
    • B.S. Stewart and CC. White, Multiobjective A*, J. ACM 38 (1991) 775-814.
    • (1991) J. ACM , vol.38 , pp. 775-814
    • Stewart, B.S.1    White, C.C.2
  • 6
    • 0018504934 scopus 로고
    • A minimax algorithm better than alpha-beta?
    • G.C. Stockman, A minimax algorithm better than alpha-beta?, Artif. Intell. 12 (1979) 179-196.
    • (1979) Artif. Intell. , vol.12 , pp. 179-196
    • Stockman, G.C.1


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