Álvaro Begué wrote:
On Tue, May 13, 2008 at 8:10 PM, Weston Markham
[EMAIL PROTECTED] wrote:
On Tue, May 13, 2008 at 7:08 PM, Gunnar Farnebäck
[EMAIL PROTECTED] wrote:
And I agree, don't even think of doing this with floating point
numbers.
This is a bit tangential to computer go.
Thanks for the help with this. I suspect I will go directly for a heavy playout
implementation and avoid writing some of the trickier the light playout code so
I probably will be implementing this soon.
___
computer-go mailing list
Álvaro Begué wrote:
On Tue, May 13, 2008 at 4:22 PM, Carter Cheng
[EMAIL PROTECTED] wrote:
2) When generating random variables for the case where the values
of placing a stone on different points on the board are
different. Are there good ways to throw and determine which
point
This could be extended rather easily to an n-ary tree. With 9x9 a
natural choice is 3, but unfortunately 19 is prime.
It's basically a tradeoff between how many adds and how many compares
you want to do. I suppose you would do one update for every pick
(unless you pick an illegal point and want
On Tue, May 13, 2008 at 7:08 PM, Gunnar Farnebäck [EMAIL PROTECTED] wrote:
And I agree, don't even think of doing this with floating point
numbers.
This is a bit tangential to computer go. But you have piqued my curiosity
Offhand, that sounds rather extreme to me. Perhaps I haven't
On Tue, May 13, 2008 at 8:10 PM, Weston Markham
[EMAIL PROTECTED] wrote:
On Tue, May 13, 2008 at 7:08 PM, Gunnar Farnebäck [EMAIL PROTECTED] wrote:
And I agree, don't even think of doing this with floating point
numbers.
This is a bit tangential to computer go. But you have piqued my
