Abstract
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.
Original language | English |
---|---|
Title of host publication | 2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9781479986767 |
DOIs | |
Publication status | Published - 2015 Aug 3 |
Event | 16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Takamatsu, Japan Duration: 2015 Jun 1 → 2015 Jun 3 |
Other
Other | 16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 |
---|---|
Country/Territory | Japan |
City | Takamatsu |
Period | 15/6/1 → 15/6/3 |
Keywords
- connectedness
- graph theory
- the game of Go
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Networks and Communications
- Computer Science Applications
- Software