Hey Chris, That's an interesting paper as well, but it's not the one I was referring to in my e-mail. Thanks to the power of Google Scholar, I was able to track the one I was thinking of down. The graphs are called CFGs (common fate graphs) and there's quite a few papers about them: http://scholar.google.com/scholar?hl=en&q=go+common+fate+graph&btnG=Search&as_sdt=2000&as_ylo=&as_vis=0
In particular: http://www.springerlink.com/index/1MAU2HFBXLMQKLLJ.pdf and http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.126.2647&rep=rep1&type=pdf(I hope they are freely accessible to everyone; they are for me, but I can't tell if it's just because I'm on Google's network at the moment) <http://scholar.google.com/scholar?hl=en&q=go+common+fate+graph&btnG=Search&as_sdt=2000&as_ylo=&as_vis=0>Hopefully this will pique your interest, Steve and Chris :) Cheers, Adrian On Thu, Nov 18, 2010 at 10:20 PM, Christopher Martin < [email protected]> wrote: > Hi, my name is Chris. > > I am an undergraduate student studying mathematics and computer science. I > have just finished a course in graph theory and am currently working on > project where i am designing graphs as adjacency matrices using java. > > I found this paper: > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.4163&rep=rep1&type=pdf > > Not sure if it's the one you mean, it seems quite relevant though. > > Do you have a name or author? ISBN? ;) > > > > ________________________________________ > From: [email protected] [[email protected]] on > behalf of Adrian Petrescu [[email protected]] > Sent: Friday, November 19, 2010 10:28 AM > To: [email protected] > Subject: Re: [Computer-go] Adjacency matrix > > I once read a very interesting paper about such an approach. It was > basically just describing a graph data structure where every group and > contiguous region of empty squares was represented by a vertex, and then > showing that various important properties of the position were preserved > even in this highly-compressed representation. > > I'll try to find the paper online tonight, though I don't know how high my > chances are -- I originally saw it in a (paper) library. > > Cheers, > Adrian > > On Thu, Nov 18, 2010 at 3:25 PM, Steve Safarik <[email protected] > <mailto:[email protected]>> wrote: > Hi all. I'm looking at some graph theory approaches to Go, and wondering > if anyone has come up with a workable adjacency matrix representation for > the board? It's not entirely clear what "adjacent" means with regards to > the interface between black & white stones, stones at a distance, etc. Same > color stones next to each other is quite different from opposite color > stones next to each other. Any thoughts? > > Steve. > > > _______________________________________________ > Computer-go mailing list > [email protected]<mailto:[email protected]> > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go > >
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
