• Title/Summary/Keyword: Alive String Graph

Search Result 1, Processing Time 0.018 seconds

Static Analysis In Computer Go By Using String Graph (컴퓨터 바둑에서 String Graph를 사용한 정적분석)

  • 박현수;김항준
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.59-66
    • /
    • 2004
  • We define a SG(String Graph) and an ASG(Alive String Graph) to the purpose to do static analysis. For a life and death judgment, we apply the rule to the situation which the stone is included and not included. We define the rules that are SR(String Reduction), ER(Empty Reduction), ET(Edge Transform), and CG(Circular Graph), when the stone is not included. We define the rules that are DESR(Dead Enemy Strings Reduction) and SCSR(Same Color String Reduction), when the stone is included. We evaluate a SG that it is an ASG or not by using rules. And we use APC(Articulation Point Check) nile according to number of articulation points lot a life and death judgment. The performance of our method has been tested on the problem set IGS_31_counted form the Computer Go Test Collection. The test set contains 11,191 Points and 1,123 Strings. We obtain 92.5% accuracy of Points and 95.7% accuracy of Strings.