IEEE Transactions on Computational Intelligence and AI in Games
Special Issue on Monte Carlo Techniques and Computer Go
Special-issue editors: Chang-Shing Lee, Martin Müller, Olivier Teytaud
In the last few years Monte Carlo Tree Search (MCTS) has
revolutionised Computer Go, with MCTS programs s
not so long ago (after its win in the computer olympiad) it was
announced (or was it just a rumour) that Zen would come publicly
available or available as commercial package.
Any news about this?.
___
computer-go mailing list
computer-go@computer-go.org
Willemien wrote:
>not so long ago (after its win in the computer olympiad) it was
>announced (or was it just a rumour) that Zen would come publicly
>available or available as commercial package.
It is already shipped in Japan, as Tencho no Igo.
The product's name in English is Zenith Go. (Tencho
> It is already shipped in Japan, as Tencho no Igo.
http://soft.mycom.co.jp/pcigo/tencho/index.html
Looks like Windows only. Anyone know if it will run under wine on linux?
They are advertising it as 2-dan (i.e. Japanese 2-dan).
A rather pricey 13,400 yen, or 10,752 yen ($120) online.
Darren
-
> They are advertising it as 2-dan (i.e. Japanese 2-dan).
Sorry, I skimmed it too quickly. It actually says: "KGS 2-dan, which is
equivalent to Japanese Nihon Kiin 3-4 dan".
Darren
--
Darren Cook, Software Researcher/Developer
http://dcook.org/gobet/ (Shodan Go Bet - who will win?)
http://dco
Darren,
If it doesn't work on Wine, you could always load a VM, like Sun's VirtualBox,
install a copy of Windows in that and play from there. VirtualBox has very good
performance metrics at above 95% of max (non VM) speed. And there's plenty of
throw-away copies of XP licenses available all ove
Darren Cook wrote:
>> They are advertising it as 2-dan (i.e. Japanese 2-dan).
>
>Sorry, I skimmed it too quickly. It actually says: "KGS 2-dan, which is
>equivalent to Japanese Nihon Kiin 3-4 dan".
Actually it is a little misleading.
They didn't say that the commercial version is KGS 2d :-)
Its 2
Before monte carlo I spent a couple of years writing and tuning an
alpha-beta searcher. It's still in there and I ship it to provide the lower
playing levels. Alpha-beta with limited time makes much prettier moves than
monte carlo.
Would there be interest in a paper that compares the same knowle
> Before monte carlo I spent a couple of years writing and tuning an
> alpha-beta searcher. It's still in there and I ship it to provide the
> lower
> playing levels. Alpha-beta with limited time makes much prettier moves
> than
> monte carlo.
>
> Would there be interest in a paper that compares
RAVE is part of a larger family of algorithms. In general we can use
direct Monte-Carlo results (i.e., the move played directly from a
node) to determine the probability of winning after playing such a
move. The generalized RAVE (GRAVE?) family does this by including
(usually with some disc
Peter Drake wrote:
>The more I study this and try different variants, the more impressed I
>am by RAVE. "Boards after the current board" is a very clever way of
>defining similarity. Also, recorded RAVE playouts, being stored in
>each node, expire in an elegant way. It still seems that RAVE f
We place a lot of faith in RAVE. Our faith is justified 99% of the time. But
when does
faith become overconfidence?
Perhaps we just need an exploration approach that is more "fail-safe." For
example, an
epsilon-greedy strategy to be applied in states that have a lot of
exploration but still s
Peter Drake wrote:
>The more I study this and try different variants, the more impressed I
>am by RAVE. "Boards after the current board" is a very clever way of
>defining similarity. Also, recorded RAVE playouts, being stored in
>each node, expire in an ele
Tried CRAVE also, using 3x3 patterns as the context. It didn't work.
David
> -Original Message-
> From: computer-go-boun...@computer-go.org [mailto:computer-go-
> boun...@computer-go.org] On Behalf Of Peter Drake
> Sent: Thursday, September 24, 2009 12:00 PM
> To: Computer Go
> Subject:
14 matches
Mail list logo
