On May 31, 2009, at 9:27 PM, David Fotland wrote:
1) yes. I maintain liberty counts during MC playouts.
2) Something else. I remove one liberty from the adjacent chain,
then look
at the empty points adjacent to the new stone and check if they are
also
adjacent to the adjacent chain, and
Hi.
I've been thinking about pondering, and the way the tree has to be built to
support pondering. Because with pondering, the thinking time for a move can
be very big theoretically, I would like to handle automatic pruning of the
tree to avoid running out of memory. Right now I have a fixed size
On Mon, Jun 1, 2009 at 7:59 AM, Ingo Althöfer 3-hirn-ver...@gmx.de wrote:
Nick Wedd explained:
stv is Steenvreter. Its creator is indeed Erik van der Werf,
whose KGS account is evdw. Its name is Dutch for stone eater...
Congratulations to Erik van der Warf for the Win!
Thanks!
By the
Hi Erik,
By the way, Steenvreter is such a nice name. You should
call your baby by full name on KGS.
When I registered the kgs account for Steenvreter the name was too
long, so I had to shorten it :-(
I've update stv's profile to show Steenvreter under 'Real Name'
Thanks.
10 letters seem
Back in 1997 I made a $1000 bet with John Tromp that he wouldn't be
beaten my a computer before 2011. I've made a page to publicize the bet:
http://dcook.org/gobet/
I hope it is accessible beyond just the experts on this list, and can
help bring some publicity for computer go generally. So
Darren Cook wrote:
Back in 1997 I made a $1000 bet with John Tromp that he wouldn't
be beaten my a computer before 2011. I've made a page to publicize
the bet: http://dcook.org/gobet/
Interesting.
Can you add John Trump's current/recent view on the bet
to your site?
Ingo.
--
Nur bis
On Mon, Jun 1, 2009 at 7:05 AM, Darren Cook dar...@dcook.org wrote:
Back in 1997 I made a $1000 bet with John Tromp that he wouldn't be
beaten my a computer before 2011.
That seems like a bad bet.
Why would John be motivated to try to win if he would lose $1000 by winning
the game?
- Don
Ok, I read your link on the bet and now I understand. The bet you made was
that John Tromp WOULD be beaten, not that he would not.
I don't bet, but if I did I would feel that John's money is safe.
This is exactly what computer Go needs. Tangible goals, very specific
proposals on benchmark
In dimwit we simply increase the number of visits to a node before it
is added to the UCT tree, to slow down its growth. I wasn't too happy
about how selective the tree got with a long time to think, but it's
unclear if this particular hack had anything to do with that.
Álvaro.
On Mon, Jun 1,
In dimwit we simply increase the number of visits to a node before it
is added to the UCT tree, to slow down its growth. I wasn't too happy
about how selective the tree got with a long time to think, but it's
unclear if this particular hack had anything to do with that.
Álvaro.
I already
On Mon, Jun 1, 2009 at 9:38 AM, Isaac Deutsch i...@gmx.ch wrote:
In dimwit we simply increase the number of visits to a node before it
is added to the UCT tree, to slow down its growth. I wasn't too happy
about how selective the tree got with a long time to think, but it's
unclear if this
No. We use a threshold that is a function of how large the tree
already is. It starts at 5 and then we increase it as the tree grows
larger. I think the exact formula scaled with something like the
log(tree_size)^2, but I would have to check when I get home.
Álvaro.
Ah, now I understand.
On Mon, Jun 1, 2009 at 10:10 AM, Isaac Deutsch i...@gmx.ch wrote:
No. We use a threshold that is a function of how large the tree
already is. It starts at 5 and then we increase it as the tree grows
larger. I think the exact formula scaled with something like the
log(tree_size)^2, but I would
Well, I'll take that over crashing with an out-of-memory error. :)
Still, pruning seems better to me and has the same effect. ;p
--
Nur bis 31.05.: GMX FreeDSL Komplettanschluss mit DSL 6.000 Flatrate und
Telefonanschluss nur 17,95 Euro/mtl.!* http://portal.gmx.net/de/go/dsl02
Valkyria simply do not expand the tree when it runs out of unused nodes.
That would be the most simple thing to prevent crashing.
Then one could consider pruning the tree in order to be able to expand
the tree even deeper.
-Magnus
Quoting Isaac Deutsch i...@gmx.ch:
Well, I'll take that
On Mon, Jun 1, 2009 at 11:22 AM, Isaac Deutsch i...@gmx.ch wrote:
Well, I'll take that over crashing with an out-of-memory error. :)
Still, pruning seems better to me and has the same effect. ;p
But is it better? I think it's not so obvious without thorough testing.
Pruning throw away
It seems that it would be better to always expand after one visit, and prune
nodes with less than N visits, than to only expand after N visits.
I expand after every visit and prune nodes with few visits when I need to.
Davdi
-Original Message-
From: computer-go-boun...@computer-go.org
Congratulations to Steenvreter, winner of yesterday's KGS bot
tournament, with three more wins than its nearest rival!
The results are now at http://www.weddslist.com/kgs/past/47/index.html
As usual, I look forward to your reports of the errors on that page.
I will also welcome opinions and
I've optimized my disk access to the point where I'm mostly CPU limited now, even when using a standard hard disk instead of an SSD. I can now create trees of
up to about 30 billion nodes, which would take about a week. The simulation rate is continuously going down because so much time is
On Mon, Jun 1, 2009 at 4:57 PM, Michael Williams
michaelwilliam...@gmail.com wrote:
I've optimized my disk access to the point where I'm mostly CPU limited
now, even when using a standard hard disk instead of an SSD. I can now
create trees of up to about 30 billion nodes, which would take
SlugGo has not been participating because we had made no progress.
I hope to have something by the end of summer.
Cheers,
David
On 1, Jun 2009, at 1:39 PM, Nick Wedd wrote:
would like to know what I might do to attract more entrants.
___
Yes, when memory is full, I save and free all leaf nodes (which is the vast
majority). Nodes are loaded as needed.
Don Dailey wrote:
On Mon, Jun 1, 2009 at 4:57 PM, Michael Williams
michaelwilliam...@gmail.com mailto:michaelwilliam...@gmail.com wrote:
I've optimized my disk access to
On Mon, Jun 1, 2009 at 10:39 PM, Nick Wedd n...@maproom.co.uk wrote:
Congratulations to Steenvreter, winner of yesterday's KGS bot tournament,
with three more wins than its nearest rival!
The results are now at http://www.weddslist.com/kgs/past/47/index.html
Thanks!
As usual, I look
One factor is that there seems to be a narrow range between too few entrants
and too many. For any given contest, the potential pool includes an elite few
who have a chance at first place and maybe a couple who have a new or newly
improved bot. There is?a larger group, back in the pack,?whose
contests are never hindered by weak opponents,
in my opinion. the more the merrier the better of
course!
s.
2009/6/1 dhillism...@netscape.net:
One factor is that there seems to be a narrow range between too few entrants
and too many. For any given contest, the potential pool includes an
On Jun 1, 2009, at 6:10 PM, Erik van der Werf
erikvanderw...@gmail.com wrote:
I will also welcome opinions and preferences about the format of
such events
in future. Attendances got low towards the end of last year, so I
gave them
up for a few months. The last two, in April and May,
In the past, I've entered bots and indicated that I would not be
offended if my bot was removed. Don has made use of such offers from
Aloril in the past. Maybe you could make a similar offer?
Sent from my iPhone
On Jun 1, 2009, at 6:33 PM, dhillism...@netscape.net wrote:
One factor is that
http://dcook.org/gobet/
Can you add John Trump's current/recent view on the bet
to your site?
John and I both voted Too Close To Call. But looking at the voting
this morning I'm surprised to see Darren is winning, by 12 to 11 to 8.
If the match was today, and I had to choose one or the
In message 8cbb1200f1dffd9-cbc-...@mblk-m02.sysops.aol.com,
dhillism...@netscape.net writes
One factor is that there seems to be a narrow range between too few
entrants and too many. For any given contest, the potential pool
includes an elite few who have a chance at first place and maybe a
I planned to enter this one, but I was busy, then overslept and it was
already going when I got to my computer.
I prefer full size boards, since that's a more difficult problem, and games
at 19x19 give me more to work with. Short time limits are fine. Perhaps
19x19 with 15 or 20 minutes each?
Since I learned about NP here on the computer-go mailing list, I thought I'd
share this recent blog post about it.
http://www.codinghorror.com/blog/archives/001270.html
Phil
___
computer-go mailing list
computer-go@computer-go.org
31 matches
Mail list logo
