On Mon, Jan 03, 2011 at 08:24:43AM +0800, Aja wrote:
Zen uses sequence-like AND probabilistic simulation.
Basically it plays around the previous move randomly like MoGo, and these
moves are biased by gamma values like Crazy Stone.
I am also trying to use probabilistic simulation on the whole
Hi Robert,
Perhaps my answer was a bit cryptic. I'll try to explain.
In a computer go program it is indeed needed to detect cycles when you
want to claim, for example, a tie or no-result. So you're right about
that.
However, to evaluate a position and infer the best move it is
generally not
On 03.01.2011 12:11, Erik van der Werf wrote:
Under Japanese style ko rules, the long-term history is never needed
to infer the best move.
Do you mean long2 or longcycle_length?
--
robert jasiek
___
Computer-go mailing list
Computer-go@dvandva.org
Hi Petr,
Hmm, I thought based on your paper that Erica uses a sort of a hybrid -
probabilistic simulation completely, but with all but 3x3 feature filled
in only around the last move anyway. So, one could say, Zen-like, but
with 3x3-based tenuki sampling or whatever you want to call it. :-)
On Jan 3, 2011, at 10:47 AM, Joona Kiiski wrote:
Hi everyone!
In last few years I've spend a lot of time with computer chess,
but in general I found Go much more interesting than chess.
I have zero experience in writing go program, but I've read with
great interest about Monte Carlo playouts
Hi Joona!
Good to see you pop up here.
I think there are several open source go programs. I think fuego is one of
the better ones but I could be wrong.
The playouts started out as simply uniformly random games with the only
condition that you did not fill your own 1 point eye.But then it
Hey Don,
I doubt anyone would have faulted you for mentioning CGOS, which is very
valuable for testing go programs.
Cheers,
David
On 3, Jan 2011, at 10:57 AM, Don Dailey wrote:
Hi Joona!
Good to see you pop up here.
I think there are several open source go programs. I think fuego is
One basic trick almost everyone uses is to never play in a possible
eye, which is a vacant point surrounded orthogonally by friendly
stones, with no more than one (away from the edge) or zero (at the
edge or corner) diagonal neighbors occupied by enemy stones.
Just curious. Does this
Welcome,
On Mon, Jan 3, 2011 at 10:47 AM, Joona Kiiski joona.kii...@gmail.comwrote:
Hi everyone!
In last few years I've spend a lot of time with computer chess,
but in general I found Go much more interesting than chess.
I have zero experience in writing go program, but I've read with
Hi!
On Mon, Jan 03, 2011 at 12:50:31PM -0800, René van de Veerdonk wrote:
LibEgo is an elegant and efficient (earlier versions, anyway) open source
C++ MCTS-engine
Orego is an open source Java MCTS-engine
Fuego is a fully featured and well documented C++ MCTS-engine (several
engines on a
On Mon, Jan 3, 2011 at 2:13 PM, Robert Jasiek jas...@snafu.de wrote:
On 03.01.2011 13:44, Erik van der Werf wrote:
This is handled trivially by observing that one sided passes/captures
more in each cycle.
How do you distinguish that from the opposing program passing as a tactical
mistake
I started a blog about computer Go on
http://computer-go-adventures.blogspot.com/
So far there are three posts on UEC cup (long), John Tromp's shodan bet games
against Many Faces (short) and the upcoming BIRS workshop (short). Enjoy!
Martin
12 matches
Mail list logo
