• Title/Summary/Keyword: filling all dames

Search Result 1, Processing Time 0.014 seconds

Score-Counting Algorithm for Computer Go (컴퓨터 바둑에서 계가 알고리즘)

  • Park, Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.1
    • /
    • pp.49-55
    • /
    • 2007
  • 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.