Browse > Article

Score-Counting Algorithm for Computer Go  

Park, Hyun-Soo (Dept. of Computer Information Technology, Kyungdong College of Techno-Information)
Publication Information
Journal of the Institute of Electronics Engineers of Korea CI / v.44, no.1, 2007 , pp. 49-55 More about this Journal
Abstract
This paper presents a method of score counting for computer Go that includes the consideration of stability, management of dead stones, and an algorithm for score counting. Thus, method for managing dead stones, filling all dames, and making additional moves is presented, along with a score-counting algorithm, where dames are defined as empty points that are not included in the area of a group, while additional moves are required for life when filling all the dames. In experiments using the final positions of 362 games, a mean error of 8.66, 5.96, and 4.15 was recorded for the score counting produced by the CGoban, HandTalk, and proposed methods, respectively. The proposed method was confirmed by experiments where it was success fully applied to the final positions.
Keywords
score-counting algorithm; filling all dames; additional moves; final positions; computer Go;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J.W.H.M. Uiterwijk E.C.D. Vander Werf, H.J. van den Herik, 'Learning to score final positions in game of Go,' 10th Advances in Computer Games conference, pp. 143-158 2003
2 M. Muller, 'Counting the score: Position evaluation in computer Go.' ICGA Journal, 25(4): pp. 219-228, 2002   DOI
3 H. S. Park, D. H. Lee, H. J. Kim, 'Static Analysis of String Stability and Group Territory in Computer Go,' Journal of the Institute of Electronics Engineers of Korea, Vol. 40CI, no.6, pp. 77-86, Nov 2003
4 H. S. Park, K. W. Kang, 'Evaluation of Strings in Computer Go Using Articulation Points check and Seki judgment,' Lecture Notes on Artificial Intelligence (LNAI 3809), Springer-Verlag, Berlin Heidelberg, pp. 197-206 2005
5 http://www.andromeda.com/people/ddyer/go/scoring-games.html