13 games were played and the total score was 8-5 for CzechBot. I wonder
how would they play if on even grounds. The general game pattern was the
usual wild middlegame wrestling typical of MC, with CzechBot usually
getting large edge initially (70% winning probability and seemingly
unshakeable
2009/8/15 Jason House jason.james.ho...@gmail.com
On Aug 14, 2009, at 11:02 PM, David Fotland fotl...@smart-games.com
wrote:
Moves often merge two groups.
I count liberties incrementally as I make moves, so no need to search to
count.
How do you detect shared libreties to avoid double
On Aug 15, 2009, at 8:22 AM, Don Dailey dailey@gmail.com wrote:
2009/8/15 Jason House jason.james.ho...@gmail.com
On Aug 14, 2009, at 11:02 PM, David Fotland fotl...@smart-
games.com wrote:
Moves often merge two groups.
I count liberties incrementally as I make moves, so no need to
My code ignored this problem, I didn't know you were talking about
merges.In my code I simply recomputed the liberty count when there was a
merge.
I'm not convinced all of this is worthwhile, especially when you keep adding
more data structure. Also, it seems like modern processors favor
Hi!
Today there was a short discussion about the strongest bot currently
online on KGS and I got curious whether ManyFaces or CzechBot (bleeding
edge MoGo) is stronger, so I made it play against ManyFaces.
CzechBot is running as dual-thread pondering MoGo on slightly loaded
dual-core
On Sat, Aug 15, 2009 at 08:33:31AM -0400, Jason House wrote:
On Aug 15, 2009, at 8:22 AM, Don Dailey dailey@gmail.com wrote:
2009/8/15 Jason House jason.james.ho...@gmail.com
On Aug 14, 2009, at 11:02 PM, David Fotland fotl...@smart-
games.com wrote:
Moves often merge two groups.
Merging two chains requires walking the smaller chain to find duplicates.
Adding a stone to a group does not require walking a chain.
David
-Original Message-
From: computer-go-boun...@computer-go.org [mailto:computer-go-
boun...@computer-go.org] On Behalf Of Carter Cheng
Sent:
I checked this position again, and Many Faces finds j3 after a few thousand
playouts, but even at a million playouts (28 seconds) it's only 61%.
From: computer-go-boun...@computer-go.org
[mailto:computer-go-boun...@computer-go.org] On Behalf Of Brian Sheppard
Sent: Saturday, August 15, 2009
There are many ways to track the liberties of a chain
And there are many different implementations of each:
* none
* count pseudo liberties
* simple count
* do count, sum, and sum squared, which can detect atari
* array of liberties
* store all liberties
* store first k liberties
*
Also, count real liberties, but dont store them.
-Original Message-
From: computer-go-boun...@computer-go.org [mailto:computer-go-
boun...@computer-go.org] On Behalf Of w...@swcp.com
Sent: Saturday, August 15, 2009 9:03 AM
To: computer-go
Subject: Re: [computer-go] representing
On Sat, Aug 15, 2009 at 09:13:02AM -0600, Brian Sheppard wrote:
assuming komi 7.5 and Chinese rule, playing at J3 white will win. After J3,
white has 35. It only needs to win the ko or takes two dames. If black
fills
the dame, it loses the ko. If it fills the ko, white can take two dames.
On Sat, Aug 15, 2009 at 10:03:11AM -0600, w...@swcp.com wrote:
There are many ways to track the liberties of a chain
And there are many different implementations of each:
* none
* count pseudo liberties
* simple count
* do count, sum, and sum squared, which can detect atari
* array
Petr Baudis wrote:
1 2 3 4 5 6 7 8 9
A - - O - - - - - -
B X X X O X - - - -
C O O X O X X - - -
D O - O X X - X X -
E - O O O X X O X X
F - X O - X O O O X
G - X O - X O O - O
H O X O - X X O O -
J - - - O X - X O -
O to play
I don't see how J3 works, black still can win the ko,
Valkyria plays J3 or capture the ko, with capturing the ko as the most
common choice. But it always thinks for some thousands of playouts
before it sees a clear win.
Magnus
Quoting David Fotland fotl...@smart-games.com:
I checked this position again, and Many Faces finds j3 after a few
On Aug 15, 2009, at 6:24 AM, Heikki Levanto wrote:
You can also use board-sized bitmaps. Merging is a trivial OR
operation.
I've seen bit-maps mentioned many times, but is there any evidence
it's faster than a 'traditional' implementation?
Mark
I tested bit maps in the cgbg framework, and they perform
slower than other techniques. However, I wrote the code in C which
does not use the built-in hardware bit tests and sets nor use SIMD
to merge or clear sets. If you do it in assembler, bitmaps might work
much better.
There are various ways
How do these link list of liberties and array of liberties variants work? Are
they sorted lists/arrays?
I considered bitmaps but it seemed in many ways a bit wasteful i.e. in most
cases for a given group the bitmap probably is extremely sparse. Also if you
are trying to identify individual
In the cgbg framework, arrays and lists are unsorted.
But, there are many reasonable variations.
You will just have to jump in and read some code or write
your own to fully understand. I recommend reading the
gnugo source, which is pretty darn good.
Michael Wing
How do these link list of
On Aug 15, 2009, at 8:52 AM, w...@swcp.com w...@swcp.com wrote:
You will just have to jump in and read some code or write
your own to fully understand. I recommend reading the
gnugo source, which is pretty darn good.
But that's exactly the kind of work you'd want to avoid if there's no
19 matches
Mail list logo
