On Fri, Aug 14, 2009 at 9:51 PM, David Fotland <fotl...@smart-games.com>wrote:
> Old Many Faces keeps linked lists of liberties for each group. They are > sorted, singly linked lists, so merges are fast. Yes, I can see that merges would be really fast with linked lists. Are they common enough to make this really worth it though? I've never tried doing it this way. > > The new UCT code does not track liberties, just keeps a count, so to find a > liberty takes a search over the points adjacent to the group. The stones > in > each group are in a linked list so this is not too slow. Even though you have a linked list don't you still have to test all the points around each stone in order to count liberties? Or do you have some kind of trick for doing this fast? - Don > > David > > > -----Original Message----- > > From: computer-go-boun...@computer-go.org [mailto:computer-go- > > boun...@computer-go.org] On Behalf Of Carter Cheng > > Sent: Friday, August 14, 2009 2:16 PM > > To: computer-go@computer-go.org > > Subject: [computer-go] representing liberties > > > > I have been having difficulties selecting a good representation for > > liberty sets for strings of stones. I am curious how other people might > be > > doing this. I suspect that for heavier playouts one would like to know > not > > only the count of the liberties but also where precisely they might be > > relatively quickly(to determine if the group is in atari among other > > things). > > > > > > > > _______________________________________________ > > computer-go mailing list > > computer-go@computer-go.org > > http://www.computer-go.org/mailman/listinfo/computer-go/ > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ >
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
