DocumentCode
518854
Title
Solving winning probability problems in Go
Author
Yu, Lei ; Zhang, Xiaojin ; Dai, Chunni ; Liu, Jingao
Author_Institution
Dept. of Electron. Sci. & Technol., East China Normal Univ., Shanghai, China
Volume
1
fYear
2010
fDate
27-29 March 2010
Firstpage
477
Lastpage
480
Abstract
Positional analysis needs to be made in the Go game, and it is true for professional players or Go program. The present Go program regards the territory scores as a major standard in its positional analysis, which is a flawed approach. In this article, an approach is proposed to calculate the winning probability, and the model parameter is further optimized by genetic algorithm. Through this approach, various winning probability models based on different levels can be obtained. After the test, it is concluded that the precision of this model can be applied in the module of middle game and end game in the computer Go.
Keywords
computer games; game theory; genetic algorithms; probability; Go game; Go program; end game module; genetic algorithm; middle game module; positional analysis; winning probability problem; Algorithm design and analysis; Artificial intelligence; Genetic algorithms; Heuristic algorithms; Humans; Military computing; Probability; Testing; Go; genetic algorithm; winning probability;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Control (ICACC), 2010 2nd International Conference on
Conference_Location
Shenyang
Print_ISBN
978-1-4244-5845-5
Type
conf
DOI
10.1109/ICACC.2010.5487148
Filename
5487148
Link To Document