Title

Recursive and Non-recursive Algorithms for the Group Size Counting Problem in Computer Go

Abstract

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 approach always answers the correct group size. Inspired by the former's tree traversal mechanism, the non-recursive approach guarantees to return the correct answers in an autonomous and scalable manner.

Meeting Name

Artificial Neural Networks in Engineering conference, ANNIE 2010 (2010: Nov. 1-3, St. Louis, MO)

Department(s)

Electrical and Computer Engineering

International Standard Book Number (ISBN)

9780791859599

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2010 ASME Press, All rights reserved.


Share

 
COinS