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 | |
| 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/Territory | 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