A model for the connectedness of stones in the game of Go

Masafumi Sato, Koichi Anada, Masayoshi Tsutsumi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We consider the connectedness in the game of Go. This game has a graph theoretical structure and the connectedness of the stones is very important to evaluate positions. In this paper, we construct the mathematical model which represents the connectedness of the stones and the relationship between blocks and null intersections. We propose the recursion of extended liberties to evaluate positions analytically.

Original languageEnglish
Title of host publication2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479986767
DOIs
Publication statusPublished - 2015 Aug 3
Event16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Takamatsu, Japan
Duration: 2015 Jun 12015 Jun 3

Other

Other16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015
CountryJapan
CityTakamatsu
Period15/6/115/6/3

    Fingerprint

Keywords

  • connectedness
  • graph theory
  • the game of Go

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Cite this

Sato, M., Anada, K., & Tsutsumi, M. (2015). A model for the connectedness of stones in the game of Go. In 2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings [7176259] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SNPD.2015.7176259