A mathematical formulation to efficiently determine «life status» in the game of Go

Masafumi Sato, Koichi Anada, Masayoshi Tsutsumi

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

3 Citations (Scopus)


The game of Go is an ancient board game. In this game, players aim to capture the stones of their opponent by enclosing them. One possible condition for a stone is described as «safe». A safe stone can never be captured. This has been represented with a static determination by Benson [1]. In this paper, we analyze this determination mathematically, using the BW graph model that was introduced by Sato et al. [2][3][4][5]. As the result, we propose a new representation that reduces the required number of backtracking searches.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE International Conference on Industrial Technology, ICIT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781467380751
Publication statusPublished - 2016 May 19
EventIEEE International Conference on Industrial Technology, ICIT 2016 - Taipei, Taiwan, Province of China
Duration: 2016 Mar 142016 Mar 17


OtherIEEE International Conference on Industrial Technology, ICIT 2016
Country/TerritoryTaiwan, Province of China


  • connectedness
  • graph theory
  • the game of Go
  • unconditional life

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications

Cite this