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

2 Citations (Scopus)

Abstract

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.
Pages1684-1689
Number of pages6
Volume2016-May
ISBN (Electronic)9781467380751
DOIs
Publication statusPublished - 2016 May 19
EventIEEE International Conference on Industrial Technology, ICIT 2016 - Taipei, Taiwan, Province of China
Duration: 2016 Mar 142016 Mar 17

Other

OtherIEEE International Conference on Industrial Technology, ICIT 2016
CountryTaiwan, Province of China
CityTaipei
Period16/3/1416/3/17

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications

Cite this

Sato, M., Anada, K., & Tsutsumi, M. (2016). A mathematical formulation to efficiently determine «life status» in the game of Go. In Proceedings - 2016 IEEE International Conference on Industrial Technology, ICIT 2016 (Vol. 2016-May, pp. 1684-1689). [7475016] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICIT.2016.7475016