[computer-go] incremental liberty counts

[Mark Boon]

Sorry if I'm late responding. The 'marking trick' is explained in my
library and implemented by BoardMarker. Yes, you need a separate array
to store the marks in. But you don't need time to clear up the marks.
It should show significant speed-up over clearing the marks.

On 8/30/06, Don Dailey <drd at mit.edu> wrote:
> Here is the difference in code for ONE of the direction tests stripped
> of all irrelevant details:
>
> OLD:
>
> if (p->bd[t+1] == ene) {
>     elist[cc++] = t+1;
>     p->bd[t+1] |= FLAG;
> }
>
> NEW:
>
> if (p->bd[t+1] == ene && clear[t+1] != age) {
>    elist[cc++] = t+1;
>    clear[t+1] = age;
> }

Beats me what this code means. I'd advise against  using abbreviations
when showing code to others if you expect a meaningful response. (I've
learnt the hard way to never assume I remember what an abbreviation
means after a few months, let alone a few years.)

Mark