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 条

[1]

[Anonymous], 2000, GAMES AI RES

[2]

[Anonymous], THESIS U WISCONSIN

[3]

[Anonymous], 1995, THESIS ETH ZURICH

[4]

[Anonymous], P 29 NAT C ACM

[5]

[Anonymous], P 6 INT JOINT C ART

[6]

BENSON DB, 1976, INFORM SCIENCES, V10, P17, DOI 10.1016/0020-0255(76)90059-1

[7]

BERLEKAMP E, 1996, GAMES NO CHANCE COMB, V29, P365

[8]

Berlekamp E.R., 1982, Winning Ways for Your Mathematical Plays

[9]

Berlekamp Elwyn, 1994, Mathematical Go-Chilling gets the last point

[10]

Boon Mark, 1990, COMPUTER GO, V13, P12

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