Hi!
On Tue, Jul 06, 2010 at 06:52:36AM -1000, Mark Boon wrote:
> Quite a while back I tried to put together a set of requirements of what
> needed to be done to make a minimal implementation of a board and liberty
> administration that kept liberties incrementally, including their locations.
> This because even though my tactics implementation is very fast, I had found
> that my program spent a considerable percentage of its time in the getNlib()
> function, which is the routine that loops over the stones to fetch its
> liberties.
I can do this already, and it's rather easy to do it incrementally;
moreover, usually you are interested only in liberties of low-liberty
groups, so I use the GNUGo method and keep explicit list only of up to
five liberties of a group. I think I have found that it speeds
1-lib/2-lib tactics a lot.
But please note that what I'm after is something completely different.
I'm not after liberties, but after the opposite - the neighboring groups,
and I need a complete list to find all atari'd neighbors. Also, I do need
to do this incrementally since I need to have this information about all
atari'd groups at each move (for the probability distribution).
--
Petr "Pasky" Baudis
The true meaning of life is to plant a tree under whose shade
you will never sit.
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
