It may be helpful to incrementally compute information on a move-by-move basis,
rather than recompute for all points on the board.
For example; if you choose to store the liberties of groups, and a single stone
is placed on the board, it affects only those strings which have thereby lost a
liberty. It may lead to combining two or more strings. It may also lead to a
capture, which creates liberties -- but captures are much less frequent than
non-capturing moves, so it pays to optimize the non-capturing move heavily.
Similar approaches may work for whatever else is being measured. If one stone
is played at a time, what does this change? Recomputing anything 361 times for
each move of each playout is likely to be sluggish.
Terry McIntyre <terrymcint...@yahoo.com>
Anarchism is founded on the observation that since few men are wise enough to
rule themselves, even fewer are wise enough to rule others. - Edward Abbey
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
