Estimating the Possible Omission Number for Groups in Go by the Number of n-th Dame
- 357 Downloads
This paper describes a new method for estimating the strength of a group in the game of Go. Although position evaluation is very important in Computer Go, the task is very complex, so good evaluation methods have not yet been developed. One of the major factors in evaluation is the strength of groups. In general, this evaluation is a difficult problem, so it is desirable to have a simple method for making a rough estimate. We define PON (Possible Omission Number) as a precise measure for the strength of groups, and present a simple method for the rough estimation of PON by calculating n-th dame (liberties). We report some experiments indicating the effectiveness of the method.
KeywordsGo Strength of groups Possible omission number PON n-th dame
Unable to display preview. Download preview PDF.
- 1.M. Boon. A pattern matcher for Goliath, Computer Go, No.13, Winter, 1989–1990.Google Scholar
- 2.R. Popma and L.V. Allis. Life and death refined, Heuristic Programming in Artificial Intelligence, 3, 157–164, 1992.Google Scholar
- 3.Sanechika N. et. al.. The specification of Go system Gosedai, ICOT Technical Report TM-0618, Institute for New Generation Computer Technology, 1991. (in Japanese)Google Scholar
- 4.Sei S.. The experiment of Go program “Katsunari” using memory-based reasoning, Proceedings of GPW’96, 115–122, 1996. (in Japanese)Google Scholar
- 5.Tajima M. and Sanechika N.. Applicability of KPV method to Go, Proceedings of GPW’95, 37–46, 1995. (in Japanese)Google Scholar
- 6.Special Go game, Masao Katoh vs. Yoshiharu Habu, Nikkei Mook Igo Taizen, Nihon Keizai Shinbunsha, Tokyo, 6–16, ISBN4-532-18019-8, 1996. (inJapanese)Google Scholar