On 4/1/16 9:40 AM, Petr Baudis wrote:
On Fri, Apr 01, 2016 at 07:08:34AM +0200, Robert Jasiek wrote:
On 01.04.2016 02:22, djhbrown . wrote:
kogo is great for corner openings
Kogo contains many mistakes. Too many kyus got their hands on it.
It would be better to spend 3+ weeks using kombilo
On Fri, Apr 01, 2016 at 07:08:34AM +0200, Robert Jasiek wrote:
> On 01.04.2016 02:22, djhbrown . wrote:
> >kogo is great for corner openings
>
> Kogo contains many mistakes. Too many kyus got their hands on it.
>
> It would be better to spend 3+ weeks using kombilo on GoGoD and create a new
>
On 01.04.2016 02:22, djhbrown . wrote:
kogo is great for corner openings
Kogo contains many mistakes. Too many kyus got their hands on it.
It would be better to spend 3+ weeks using kombilo on GoGoD and create a
new joseki tree. A summary of such an effort (with some interesting,
on the subject of tools for learning josekis, i would love to have to
the help of a computerised assistant who could show me a flip-through
"photo album" of how alternative paths in a joseki end up, without
having to plod along the paths (which to me is a dark and mysterious
tree of paths in a
On 31.03.2016 16:54, Bill Whig wrote:
Wouldn't you agree that a lot of people (most?) might might advance more swiftly
> with move suggestions rather than text that they have to work through
like a textbook?
I say the opposite.
Move suggestions without any additional information are
Message: 1
Date: Thu, 31 Mar 2016 14:33:39 +0200
From: Robert Jasiek <jas...@snafu.de>
To: computer-go@computer-go.org
Subject: Re: [Computer-go] new challenge for Go programmers
Message-ID: <56fd1923.4080...@snafu.de>
Content-Type: text/plain; charset=UTF-8; format=flowed
On 31.0
In message 20100104070048.50...@gmx.net, Ingo Althöfer
3-hirn-ver...@gmx.de writes
Hello all, especially hello Nick,
http://www.weddslist.com/kgs/future.html
are there already plans for KGS bot tournaments
in 2010?
Yes. I must set up a schedule this week. I plan to continue last
year's
Le 04/01/2010 à 14:19, Nick Wedd a écrit :
I have discussed these extra events in the past, and received feedback
here; which, unfortunately, I have forgotten. So please, anyone who is
interested, make your suggestions now.
As a spectator i would like an Hanh tournament on 19x19, not too
On Mon, Jan 04, 2010 at 01:19:25PM +, Nick Wedd wrote:
In message 20100104070048.50...@gmx.net, Ingo Althöfer
3-hirn-ver...@gmx.de writes
Hello all, especially hello Nick,
http://www.weddslist.com/kgs/future.html
are there already plans for KGS bot tournaments
in 2010?
Yes. I
In message 201001041753.46668.alain.baecker...@laposte.net, Alain
Baeckeroot alain.baecker...@laposte.net writes
Le 04/01/2010 à 14:19, Nick Wedd a écrit :
I have discussed these extra events in the past, and received feedback
here; which, unfortunately, I have forgotten. So please, anyone
On Jan 4, 2010, at 9:09 AM, Petr Baudis wrote:
I don't think Hahn tournament would be that interesting, it would
require some extensive modifications of especially the top programs
and involve a lot of work in the tournament setup as well.
I agree -- the Hahn game changes the victory
Le 04/01/2010 à 18:09, Petr Baudis a écrit :
I don't think Hahn tournament would be that interesting,
As a physicist i like to experiment first, and think later,
to understand what happened, which obviously was not foreseen ;-)
I believe it will reveal some hidden aspect of the stronger engines,
Hello all, especially hello Nick,
http://www.weddslist.com/kgs/future.html
are there already plans for KGS bot tournaments
in 2010?
Cheers, Ingo.
--
GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT!
Jetzt freischalten unter http://portal.gmx.net/de/go/maxdome01
Jeff Nowakowski wrote:
On Wed, Aug 19, 2009 at 07:27:00AM -0700, terry mcintyre wrote:
Consider the game when computer is black, with 7 stones against a very
strong human opponent.
...
Didn't this game actually happen? Didn't MoGo *beat* a pro
with 7 stones?
It was long ago: in
PS: Once again I would like to mention my report on Laziness of Monte
Carlo, at http://www.althofer.de/mc-laziness.pdf
In the meantime, a student has found the same phenomenon in UCT search
(instead of basic MC). Also in discrete online optimization (so outside
of combinatorial games) it
I like the idea very much.
But the coding effort is mostly in the GUI so it depends whether
gogui's (or other GUIS's) author will like the idea.
It has great commercial/popularity potential.
But it is not so important for research.
Lukasz
On Tue, Apr 21, 2009 at 07:35, Ingo Althöfer
Yes, this is a powerful feature that all chess interfaces have.
There is one issue with GTP that will have to be kludged around - there is
no way to stop an engine from thinking that is provided naturally by gtp.
GTP has the nice feature that you can pipe in commands from a file, but it's
not an
My email got cut off near the end.My final thought was that it would be
preferable to stick with GTP, just a revised asynchronous version.
- Don
2009/4/21 Don Dailey dailey@gmail.com
Yes, this is a powerful feature that all chess interfaces have.
There is one issue with GTP that
Hello, a small set of a low dan datapoints:
I've been playing 9x9 go against MoGoBot on KGS as white
(with guest acount guest47) with komi 0,5. My result
sofar is 4 wins and 9 losses, which was a nice surprise
for me (as an European 3 dan), since I wasn't expecting
MoGoBot to be that strong.
Hello,
I'm curious to know, how many playouts (in Sensei's 100k
is mentioned for CGOS) MoGoBot plays, i.e., how serious
version is it?
This version plays on a intel core2 duo, and on a 10 minutes game, it makes
between 40 and 5 playouts per move (more at the beginning). The
current
This version plays on a intel core2 duo, and on a 10 minutes game, it
makes between 40 and 5 playouts per move (more at the
beginning).
snip
I hope I answer here your questions.
Sylvain
Thanks for the info, my desire of MoGoBot knowledge has been satisfied ;)
-Esa
On 3/25/07, forrest curo [EMAIL PROTECTED] wrote:
Does this bunch ever get around to the merits of various ways of
representing the board and arriving at moves?
Sure, e.g.:
http://computer-go.org/pipermail/computer-go/2006-December/thread.html#7452
For example, something I suggested the
For example, something I suggested the last time I was on a computer
go
list, back in the 90's: Take an array of 7 64-bit integers...
I believe very similar techniques are pretty common - I don't know
how common but it's been used before.
I believe you might as well just use use
Since I signed up for this list, I've been receiving all sorts of
material about how to test existing programs against one another.
Does this bunch ever get around to the merits of various ways of
representing the board and arriving at moves?
For example, something I suggested the last time
24 matches
Mail list logo
