Evaluation of strings in computer go using articulation points check and seki judgment

  • Authors:

  • Hyun-Soo Park;Kyung-Woo Kang

  • Affiliations:

  • Department of Computer Information Technology, Kyungdong College of Techno-Information, Kyungpook, Korea;Department of Computer and Communication Engineering, Cheonan University, Choongnam, Korea

  • Venue:
  • AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.