> I'm now somewhat torn. The speedup from using pseudo-liberty counts > could be huge, estimating from my profiling. On the other hand, it would > be very useful to still be able to quickly check if a group is in atari > - it looks like if atari stones would get special attention during the > random games, that could make the bot a lot stronger. > > Is there any known way to get the best of the both worlds? :-)
Looking at my code I first check if the number of pseudoliberties is less than or equal to 2 (this is necessary but not sufficent for a string to be in atari given the way I compute pseudoliberties), which is very fast (it just involves a lookup because I have already computed pseudoliberties for all strings when the last move was made). If this is true I then do a slower check to see if the string in question is actually in atari. This gets the best of both worlds because most strings (ones with more than two pseudoliberties) are ruled out very quickly and only a few are looked at with the slower routine that uses real liberties to check for atari. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
