抄録
We consider the connectedness in the game of Go. This game has a graph theoretical structure and the connectedness of the stones is very important to evaluate positions. In this paper, we construct the mathematical model which represents the connectedness of the stones and the relationship between blocks and null intersections. We propose the recursion of extended liberties to evaluate positions analytically.
本文言語 | English |
---|---|
ホスト出版物のタイトル | 2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings |
出版社 | Institute of Electrical and Electronics Engineers Inc. |
ISBN(電子版) | 9781479986767 |
DOI | |
出版ステータス | Published - 2015 8月 3 |
イベント | 16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Takamatsu, Japan 継続期間: 2015 6月 1 → 2015 6月 3 |
Other
Other | 16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 |
---|---|
国/地域 | Japan |
City | Takamatsu |
Period | 15/6/1 → 15/6/3 |
ASJC Scopus subject areas
- 人工知能
- コンピュータ ネットワークおよび通信
- コンピュータ サイエンスの応用
- ソフトウェア