Many Faces also counts real liberties, and is quite fast enough.
> -Original Message-
> From: computer-go-boun...@computer-go.org [mailto:computer-go-
> boun...@computer-go.org] On Behalf Of Mark Boon
> Sent: Wednesday, April 01, 2009 1:04 PM
> To: computer-go
> Subject: Re: [computer-go]
On Thu, 2 Apr 2009, Erik van der Werf wrote:
On Wed, Apr 1, 2009 at 9:03 PM, Matthew Woodcraft
wrote:
Erik van der Werf wrote:
Jonas Kahn wrote:
No there is no danger. That's the whole point of weighting with N_{s,a}.
N_{s,a} = number of times the node s has been visited, starting with pare
On Wed, Apr 1, 2009 at 5:28 PM, Ian Osgood wrote:
> The remaining strong classical programs you're missing are KCC Igo (Silver
> Star), Haruka, and Go Intellect (Goddess on Windows). I think Wulu is also
> still available for purchase.
FYI At least on 9x9 Go Intellect already used UCT in 2007.
E
On Wed, Apr 1, 2009 at 9:03 PM, Matthew Woodcraft
wrote:
> Erik van der Werf wrote:
>> >> Jonas Kahn wrote:
>>> No there is no danger. That's the whole point of weighting with N_{s,a}.
>>>
>>> N_{s,a} = number of times the node s has been visited, starting with parent
>>> a.
>>>
>>> You can write
I can confirm, with a bit of optimization, counting real liberties is
only marginally slower than counting pseudo-liberties. So there's
really no benefit that I can see from using pseudo liberties.
Mark
On Wed, Apr 1, 2009 at 8:49 AM, Álvaro Begué wrote:
> When John Tromp and I were thinking ab
Erik van der Werf wrote:
> >> Jonas Kahn wrote:
>> No there is no danger. That's the whole point of weighting with N_{s,a}.
>>
>> N_{s,a} = number of times the node s has been visited, starting with parent
>> a.
>>
>> You can write Value of a node a = (\sum_{s \in sons} N_{s,a} V_s) / (\sum
>> N_{s
When John Tromp and I were thinking about these things in 2007 we
decided to switch to counting real liberties instead of
pseudo-liberties. Someone (Rémi?) told us that in the end the
performance difference wasn't very large, and we verified this.
Álvaro.
On Wed, Apr 1, 2009 at 2:08 PM, Isaac De
Hi
I'm currently using the method described here to detect if a group is in
atari (1 real liberty):
http://computer-go.org/pipermail/computer-go/2007-November/012350.html
Thus I store the number of pseudo libs, the sum and the sum of squares for
each group.
Now for heavy playouts, it would be u
Stefan Mertin wrote:
> More than ten thousand games 19x19 Go are played
> in my computer Go Tournament - time to again publish
> some results!
>
> Please have a look at my newly created site for results
> and more informations: www.igosoft.com
Hello Stefan,
nice to see you posting here, and t
Nice job! I have updated my list of strongest programs to match.
(Assumes all MCTS programs are stronger than all classical programs.)
http://senseis.xmp.net/?GoPlayingPrograms%2FDiscussion#toc8
The remaining strong classical programs you're missing are KCC Igo
(Silver Star), Haruka, and G
On Tue, Mar 31, 2009 at 10:16 PM, Jonas Kahn wrote:
> On Tue, 31 Mar 2009, Matthew Woodcraft wrote:
>
>> Jonas Kahn wrote:
>>>
>>> You might be interested by this article, for a very complete and tested
>>> answer. Plus the idea of grouping, but a good part of the effect seems
>>> to me to be givi
11 matches
Mail list logo
