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

高等学院

研究成果: Conference contribution

3 被引用数 (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.

本文言語	English
ホスト出版物のタイトル	Proceedings - 2016 IEEE International Conference on Industrial Technology, ICIT 2016
出版社	Institute of Electrical and Electronics Engineers Inc.
ページ	1684-1689
ページ数	6
巻	2016-May
ISBN（電子版）	9781467380751
DOI	https://doi.org/10.1109/ICIT.2016.7475016
出版ステータス	Published - 2016 5月 19
イベント	IEEE International Conference on Industrial Technology, ICIT 2016 - Taipei, Taiwan, Province of China 継続期間: 2016 3月 14 → 2016 3月 17

Other

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

ASJC Scopus subject areas

電子工学および電気工学
コンピュータサイエンスの応用

文献へのアクセス

10.1109/ICIT.2016.7475016

他のファイルとリンク

引用スタイル

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 -