Hi!
Can you tell me some algorithm to compute the score ? (Both players pass,
and who is the winner...)
Thanks, Norbert
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Thanks! How can I identify dead stones?
I haven't seen algorithm for this, and it is a very important part of
a go program
2008/5/14, Don Dailey <[EMAIL PROTECTED]>:
>
> This probably explains it better than I could:
>
>http://senseis.xmp.net/?TrompTaylorRules
>
>
ndom playouts, you could compute the probability of specific
> points being owned by each player, and use that for both passing and marking
> dead stones.
>
> There are many other variants that use life and death modules, but I'll
> assume you don't have them yet
>
> Sent fr
Hi!
Here is a situation, from phase1-phase5 (I hope you'll se the pictures).
[url=
http://kepfeltoltes.hu/view/080529/phase1_www.kepfeltoltes.hu_.jpg]phase1[/url
]
[url=
http://kepfeltoltes.hu/view/080529/phase2_www.kepfeltoltes.hu_.jpg]phase2[/url
]
[url=
http://kepfeltoltes.hu/view/080529/phase
stand me.. Thanks! Norbert
2008/5/29 Nick Wedd <[EMAIL PROTECTED]>:
> In message <[EMAIL PROTECTED]>,
> Norbert Gábor Papp <[EMAIL PROTECTED]> writes
>
>> Hi!
>> Here is a situation, from phase1-phase5 (I hope you'll se the
>> pictures).
>>
>
&
Thanks!
I thought the same way! :)
Norbert
2008/5/29 Nick Wedd <[EMAIL PROTECTED]>:
> In message <[EMAIL PROTECTED]>,
> Norbert Gábor Papp <[EMAIL PROTECTED]> writes
>
>> Thanks for your reply! I've tried to make the links workable...
>>
>> Hi
2008/5/29 Gunnar Farnebäck <[EMAIL PROTECTED]>:
> Norbert Gábor Papp wrote:
> > Thanks for your reply! I've tried to make the links workable...
> >
> > Hi!
> >
> > Here is a situation, from phase1-phase5 (I hope you'll se the pictures).
> >
