Digital Library

cab1

 
Title:      DETECTING THE COMMUNITY STRUCTURES IN THE GAME OF GO
Author(s):      Yuri Malitsky , Christopher Fellows , Gregory Wojtaszczyk
ISBN:      978-972-8924-40-9
Editors:      Jörg Roth, Jairo Gutiérrez and Ajith P. Abraham (series editors: Piet Kommers, Pedro Isaías and Nian-Shing Chen)
Year:      2007
Edition:      Single
Keywords:      Clustering, Interaction Network, Computer Go
Type:      Short Paper
First Page:      135
Last Page:      139
Language:      English
Cover:      cover          
Full Contents:      click to dowload Download
Paper Abstract:      Go is a complex board game that stands impervious to the present computational intelligence. This project continues our composite approach, aiming to integrate the strengths of proven heuristic algorithms with AI techniques for boosting performance of Computer Go. In previous research, we explored Support Vector Machine (SVM) supervised training of a move evaluation function based on a collection of expert games. In this paper, we present a graph-based model for describing the board position and an application of Newman-Girvan edge betweenness clustering algorithm for detecting the Go dragons, “communities” of loosely connected stones.
   

Social Media Links

Search

Login