Computer Go

被引：92

作者：

Müller, M ^{[1
]}

机构：

[1] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada

来源：

ARTIFICIAL INTELLIGENCE | 2002年 / 134卷 / 1-2期

关键词：

computer Go; Go programs; game tree search; knowledge representation;

D O I：

10.1016/S0004-3702(01)00121-7

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Computer Go is one of the biggest challenges faced by game programmers. This survey describes the typical components of a Go program, and discusses knowledge representation, search methods and techniques for solving specific subproblems in this domain. Along with a summary of the development of computer Go in recent years, areas for future research are pointed out. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：145 / 179

页数：35

共 100 条

[51]

LEHNER P, 1981, THESIS U MICHIGAN AN

[52]

LEVY D, 1988, COMPUTER GAMES 1 2

[53] GO IS POLYNOMINAL-SPACE HARD [J].

LICHTENSTEIN, D ;

SIPSER, M .

JOURNAL OF THE ACM, 1980, 27 (02) :393-401

[54]

MARSLAND TA, 1992, ENCY ARTIFICIAL INTE, P224

[55]

MECHNER D, 1998, SCI, V38

[56]

MOEWS DJ, 1993, THESIS U CALIFORNIA

[57]

Morris F. L., 1981, International Journal of Game Theory, V10, P195, DOI 10.1007/BF01755964

[58]

Müller M, 1999, IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, P578

[59] Partial order bounding:: A new approach to evaluation in game tree search [J].

Müller, M .

ARTIFICIAL INTELLIGENCE, 2001, 129 (1-2) :279-311

[60] Global and local game tree search [J].

Müller, M .

INFORMATION SCIENCES, 2001, 135 (3-4) :187-206

← 1 2 3 4 5 6 7 8 9 10 →