Hi,
While recently implementing UCT, I've come across two cases where one may want
to increase the number of visits to a node by something greater than 1.
A) Leaf nodes - Artifically set the number of visits to some very high number.
The rationale for this is to accelerate propagation of the
> On Thu, Apr 2, 2009 at 5:14 AM, wrote:
> > Isaac,
> >
> > I implemented about 6 way to track liberties,
> > a couple years ago, and measured the running
> > performance, and by far the best is also the
> > simplest: keep an array of liberties for each
> > chain, and do a simple linear search
On Fri, Apr 03, 2009 at 05:07:41PM +0200, Isaac Deutsch wrote:
> > > This may seem slow, but it has a couple real
> > > advantages. First, it works with the cache
> > > to maximize locality. Second it is very simple.
>
> This *does* seem slow, even when caching the number of liberties. You
> menti
From: Heikki Levanto
On Fri, Apr 03, 2009 at 05:07:41PM +0200, Isaac Deutsch wrote:
> > > This may seem slow, but it has a couple real
> > > advantages. First, it works with the cache
> > > to maximize locality. Second it is very simple.
>
> This *does* seem s
Isaac,
Most groups have only say 4 to 8 liberties. This is why simple arrays of
liberty locations work so well. The new Intel CPUs have instructions
that can search strings 16 bytes at a time, so it could run even faster.
Bit vectors also work, but if you want a true liberty count, then you have
On Jan 14, 2009, at 1:42 PM, Mark Boon wrote:
It's difficult to get hard data about this. Go is only the most
popular game in Korea. In other countries like Japan and China it
comes second by far to a local chess variation.
Possibly Chess is more ingrained in Western culture than Go is in
hi,
You're miscounting here completely again.
Counting the number of federation members is a bad idea.
Count the number of people who know a game and regurarly play it.
Draughts (internatoinal 10x10 checkers, using polish rules) is really
tiny.
It is not culture to get a member of a club in
Hi,
I see there has been some discussion in this list about cheating remote.
In computerchess this toleration has grown out of hand.
Setting the rules clear and sharp there in computer-go might avoid
for the future a lot of problems.
There is a very simple manner to avoid cheating in go.
But l
Vincent Diepeveen wrote:
If a program under no circumstance can reproduce a specific move and
that for several occasions, then that's very clear proof of course.
[...]
Statistics prove everything here.
No. Rather it proves that the program cheats OR that the methods of
detecting cheating are
