Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

Intelligent Engineering Systems through Artificial Neural Networks, Volume 20

Cihan H. Dagli
Cihan H. Dagli
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

Computer Go has been recognized as an unconquered challenge to the Artificial Intelligence and Computational Intelligence societies since 1997 when Garry Kasparov, the human Chess champion, was defeated by the IBM supercomputer Deep Blue. Computer Go is considered more than just an unsolved problem; it also serves as an excellent test bed for novel applications to practical problems because of its clear-cut objective and the vast amount of sub-problems that allow for tests of practicality. We propose novel recursive and non-recursive approaches to count the size of groups of connected stones on a Go board. The simple and elegant recursive...

I. Introduction
II. Group Size Counting Problem in Computer Go
III. The Proposed Recursive and Non-Recursive Algorithms
IV. Simulations and Discussions
V. Conclusions
VI. Acknowledgment
VII. References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal