It seems kind of dream algorithm to be able extend results for bigger board
sizes. Exact knowledge is allways good anyway.
So amazing, it is suitable for max pseudo liberties for one string, count of
legal board positions,
maybe there is other properties for board this fits or more complex issues
which this algorithm could be somehow extended any studies about that? I
need to study it anyway, thanks.
t. harri
----- Original Message -----
From: "Gunnar Farneback" <[EMAIL PROTECTED]>
To: "computer-go" <computer-go@computer-go.org>
Sent: Sunday, April 01, 2007 9:22 PM
Subject: Re: [computer-go] Re: pseudoliberties
Chris wrote:
Just out of curiosity, how did you calculate these numbers?
Dynamic programming, along the same lines as the algorithm to count
legal board positions which was discussed on this list two years ago and
is described in depth in the paper linked from
http://homepages.cwi.nl/~tromp/go/legal.html
/Gunnar
_______________________________________________
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/
