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

Masafumi Sato; Koichi Anada; Masayoshi Tsutsumi

doi:10.1109/ICIT.2016.7475016

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

Masafumi Sato, Koichi Anada, Masayoshi Tsutsumi

Waseda University Senior High School

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 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 language	English
Title of host publication	Proceedings - 2016 IEEE International Conference on Industrial Technology, ICIT 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1684-1689
Number of pages	6
Volume	2016-May
ISBN (Electronic)	9781467380751
DOIs	https://doi.org/10.1109/ICIT.2016.7475016
Publication status	Published - 2016 May 19
Event	IEEE International Conference on Industrial Technology, ICIT 2016 - Taipei, Taiwan, Province of China Duration: 2016 Mar 14 → 2016 Mar 17

Other

Other	IEEE International Conference on Industrial Technology, ICIT 2016
Country	Taiwan, Province of China
City	Taipei
Period	16/3/14 → 16/3/17

Keywords

connectedness
graph theory
the game of Go
unconditional life

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Science Applications

Access to Document

10.1109/ICIT.2016.7475016

Cite this

A mathematical formulation to efficiently determine «life status» in the game of Go. / Sato, Masafumi; Anada, Koichi; Tsutsumi, Masayoshi.

Proceedings - 2016 IEEE International Conference on Industrial Technology, ICIT 2016. Vol. 2016-May Institute of Electrical and Electronics Engineers Inc., 2016. p. 1684-1689 7475016.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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, 7475016, Institute of Electrical and Electronics Engineers Inc., pp. 1684-1689, IEEE International Conference on Industrial Technology, ICIT 2016, Taipei, Taiwan, Province of China, 16/3/14. https://doi.org/10.1109/ICIT.2016.7475016

@inproceedings{0de783f73c5e4df78a97723288a210fa,

title = "A mathematical formulation to efficiently determine «life status» in the game of Go",

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.",

keywords = "connectedness, graph theory, the game of Go, unconditional life",

author = "Masafumi Sato and Koichi Anada and Masayoshi Tsutsumi",

year = "2016",

month = may,

day = "19",

doi = "10.1109/ICIT.2016.7475016",

language = "English",

volume = "2016-May",

pages = "1684--1689",

booktitle = "Proceedings - 2016 IEEE International Conference on Industrial Technology, ICIT 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "IEEE International Conference on Industrial Technology, ICIT 2016 ; Conference date: 14-03-2016 Through 17-03-2016",

}

TY - GEN

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

AU - Sato, Masafumi

AU - Anada, Koichi

AU - Tsutsumi, Masayoshi

PY - 2016/5/19

Y1 - 2016/5/19

N2 - 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.

AB - 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.

KW - connectedness

KW - graph theory

KW - the game of Go

KW - unconditional life

UR - http://www.scopus.com/inward/record.url?scp=84974628180&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84974628180&partnerID=8YFLogxK

U2 - 10.1109/ICIT.2016.7475016

DO - 10.1109/ICIT.2016.7475016

M3 - Conference contribution

AN - SCOPUS:84974628180

VL - 2016-May

SP - 1684

EP - 1689

BT - Proceedings - 2016 IEEE International Conference on Industrial Technology, ICIT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Conference on Industrial Technology, ICIT 2016

Y2 - 14 March 2016 through 17 March 2016

ER -