Skip to main content

Estimating the Possible Omission Number for Groups in Go by the Number of n-th Dame

  • Conference paper
  • First Online:
Computers and Games (CG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1558))

Included in the following conference series:

  • 460 Accesses

Abstract

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.

We thank Dr. Martin Müller for extensively proofreading this paper, and for useful technical feedback.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tajima, M., Sanechika, N. (1999). Estimating the Possible Omission Number for Groups in Go by the Number of n-th Dame. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-48957-6_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65766-8

  • Online ISBN: 978-3-540-48957-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics