Evaluation of Strings in Computer Go Using Articulation Points Check and Seki Judgment

  • Hyun-Soo Park
  • Kyung-Woo Kang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3809)


The purpose of this paper is to judge life and death in computer Go using Articulation Point Check(APC), Seki judgment and rules. To make static analysis possible, the researchers define a String Graph (SG) and judge the life and death of the strings using the rules. To judge the life and death of the strings, the researchers will adopt the APC Rule because it will judge life and death according to the numbers of the junctures. The researchers also suggest that Seki Rules be applied to judge Seki. By excluding Stones and using a String Graph (SG), the researchers postulate the use of SR (String Reduction), ER (Empty Reduction), ET (Edge Transformation) Rules, or CG (Circular Graph) in judging life and death. In addition, the DESR (Dead Enemy Strings Reduction) Rule was used when the dead enemy Stones were involved. Moreover, the SCSR (Same Color String Reduction) Rule was used when the dead enemy and Stones were empty and abridged. If our forces were involved in, the researchers abridged the String Graph by using SCSR (Same Color String Reduction) Rule and judged whether it was ASG(Alive String Graph) or not. The data that were used in the experiment were 31 IGS counted items among the Computer Go Test Collection composed of 11,191 points and 1,123 strings. The division of points and strings yielded 100% accuracy.


Directed Edge Suggested Method Test Collection Game Tree Strategic Game 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Benson, D.B.: Life in the game of Go. Information Sciences vol. 10, pp. 17–29 ISSN 0020-0255; Reprinted in Levy, D. N. L. (ed.) Computer Games, vol. II, pp. 203–213. Springer, New York (1976) ISBNGoogle Scholar
  2. 2.
    Muller, M.: Playing it safe: Recognizing secure territories in computer Go by using static rules and search. In: Matsubara, H. (ed.) Game Programming Workshop in Japan 1997, pp. 80–86. Computer Shogi Association, Tokyo (1997)Google Scholar
  3. 3.
    Popma, R., Allis, L.V.: Life and death refined. In: van den Herik, H.J., Allis, L.V. (eds.) Heuristic Programming in Artificial Intelligence, vol. 3, pp. 157–164. Ellis Horwood Ltd., Chichester ISBNGoogle Scholar
  4. 4.
    Muller, M.: Computer Go. Artificial Intelligence 134(1-2), 145–179 (2002) ISSN 0004-3702Google Scholar
  5. 5.
    Park, H.S., Lee, D.H., Kim, H.J.: Static Analysis of String Stability and Group Territory in Computer Go. Journal of the Institute of Electronics Engineers of Korea 40CI(6), 77–86 (2003)MathSciNetGoogle Scholar
  6. 6.
    Park, H.S., Lim, J.G., Lee, J.C.: Research On Solving Life-Death Problems Using Heuristic Function in Paduk. In: Proceedings of 21st KISS Spring Conference, vol. 21(1), pp. 233–236 (1994)Google Scholar
  7. 7.
    Chen, K., Chen, Z.: Static analysis of life and death in the game of Go. Information Sciences 121 (1999)Google Scholar
  8. 8.
    Graepel, T., Goutrie, M., Kruger, M., Hervrich, R.: Learning on graphs in the game of Go. In: International Conference on Artificial Neural Networks (ICANN-2001), Vienna, Austria (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hyun-Soo Park
    • 1
  • Kyung-Woo Kang
    • 2
  1. 1.Department of Computer Information TechnologyKyungdong College of Techno-InformationKyungpookKorea
  2. 2.Department of Computer and Communication EngineeringCheonan UniversityChoongnamKorea

Personalised recommendations