Could Sylvain (or anyone who knows) talk about MoGo's pondering
strategy? Does it just build the tree as usual or does it speculate
on some number of moves and hope that the opponent choses one of
those?
MoGo just builds the tree as usual.
Olivier
___
Hi, I'm trying to use evalgo. apparently the initial database is not being
properly created. Any tips?
I installed the latest sqlite3 & tclkit. So I did:
%./tclkit-linux-x86 evalgo.kit gotest2.db
%sqlite3 gotest2.db
SQLite version 3.2.8
Enter ".help" for instructions
sqlite> .database
Error:
Could Sylvain (or anyone who knows) talk about MoGo's pondering
strategy? Does it just build the tree as usual or does it speculate
on some number of moves and hope that the opponent choses one of
those?
___
computer-go mailing list
computer-go@computer-
Jason House said:
> What about seki situations?
>
> On Nov 5, 2007 1:41 PM, <[EMAIL PROTECTED]> wrote:
>
>> It takes some tricky analysis to work out the Japanese score, due to
>> uncertainty about life/death; likewise it's not easy for a program to
>> recognize when moving is no longer to its adva
For scoring, you could use integral instead of boolean outcomes again, which
would solve some of the problems you descibed...
This might be a great idea for programs that must deal with Japanese
scoring, but for our reseach the best thing is just to stick to Chinese
rules :)
On 11/5/07, Don Dailey
Just found the corresponding paper at
http://www.cs.ualberta.ca/~mmueller/ps/aaai05-tsumego.pdf
and some Japanese slides (maybe someone could translate parts different from
the paper?) at http://www.fun.ac.jp/~kishi/ppt_file/invited_talk_UT.ppt
The algorithm claims to be more efficient than alpha-
Yeah, this is one of the many pitfalls when trying to implement this stuff..
A clean reference implementation of all important algorithms in an
easy-to-read language like e.g. python or ruby (don't think you guys want to
read my Lisp-stuff *gg*) would really be neat (and damned slow, but that's
ano
On Nov 3, 2007 5:25 PM, Benjamin Teuber <[EMAIL PROTECTED]> wrote:
> On 11/3/07, Jason House <[EMAIL PROTECTED]> wrote:
>
> >
> >
> > On Fri, 2007-11-02 at 22:28 +0100, Benjamin Teuber wrote:
> > > I don't think there's something different at different depths in the
> > > tree..
> > > To update RA
It would be tricky indeed to implement Japanese scoring with Monte Carlo
programs.
Monte Carlo programs are very strong and thus they are not naive about
what the situation is.But I view them as "relativistic players" -
whether a group is dead or alive depends on your point of view! A
g
Le lundi 5 novembre 2007, Don Dailey a écrit :
> I noticed there are various Gnugo with Monte Carlo enhancements. Will
> any of these be integrated into the the Gnugo releases? It seems like a
> logical move.
As far as i know MonteGNU is more or less:
http://trac.gnugo.org/gnugo/ticket/150
and c
What about seki situations?
On Nov 5, 2007 1:41 PM, <[EMAIL PROTECTED]> wrote:
> It takes some tricky analysis to work out the Japanese score, due to
> uncertainty about life/death; likewise it's not easy for a program to
> recognize when moving is no longer to its advantage.
>
> How about bringi
It takes some tricky analysis to work out the Japanese score, due to
uncertainty about life/death; likewise it's not easy for a program to
recognize when moving is no longer to its advantage.
How about bringing in a Monte Carlo routine after both players have
passed?--as a scoring referree, set to
On 11/5/07, Adrian Petrescu <[EMAIL PROTECTED]> wrote:
> As a public lectures, do these things get recorded and posted online
> anywhere, Google Techtalk-style? This looks like a really interesting talk,
> but I live nowhere near where this is being held. Is there any way at all?
Perhaps it'll be
As a public lectures, do these things get recorded and posted online
anywhere, Google Techtalk-style? This looks like a really interesting talk,
but I live nowhere near where this is being held. Is there any way at all?
Thanks for bringing this to our attention at any rate :)
On 11/5/07, Jack <[E
This may be of interest
JL
-Original Message-
From: Sarah Nightingale (Interaction Recruitment PLC)
[mailto:[EMAIL PROTECTED]
Sent: 05 November 2007 17:25
To: Jack Lang
Subject: Microsoft Research Lectures: Akihiro Kishimoto, Future
University-Hakodate
MICROSOFT RESEARCH LECTURE
This is
Thanks Jacques,
I updated the page with a link to this post as well as a few other
changes to make things a bit more clear.
- Don
Jacques Basaldúa wrote:
> Here are the steps:
> ---
>
>
> 1. Get TCL. There are many "flavors" with GUI, debugger etc.
> The simplest, when you jus
I noticed there are various Gnugo with Monte Carlo enhancements. Will
any of these be integrated into the the Gnugo releases? It seems like a
logical move.
- Don
Francois Grieu wrote:
> Gnugo development release 3.7.11 is out, see
> http://www.gnu.org/software/gnugo/devel.html
>
> From the
Gnugo development release 3.7.11 is out, see
http://www.gnu.org/software/gnugo/devel.html
From the changelog:
3.7.11 released November 1, 2007
- gtp-commands.texi is not built automatically
- updates texinfo.tex
- minor doc revision
- revised configure.in, aclocal.m4 and *Makefile.in for recent a
SLOW
Last December I held a "slow" bot tournament on full boards, see
http://www.weddslist.com/kgs/past/s1/index.html
The time limits were 12 hours each sudden death, so each game took a day
and the five-round tournament ran from Monday through Friday (UTC).
I intend to hold such an event agai
Here are the steps:
---
1. Get TCL. There are many "flavors" with GUI, debugger etc.
The simplest, when you just need to run a Tk application
is something like:
http://www.equi4.com/pub/tk/tclkit-win32.upx.exe
This .exe is all you need, about 1M and without any annoyanc
Christopher Rosin wrote:
>greenpeep's patterns include the local 3x3 neighborhood. In addition,
>for each of the four nearest neighbors, it includes liberty count info if
>that neighbor is occupied, or otherwise info about 2-away point just
>beyond that neighbor if the neighbor itself is empty.
L
On 11/4/07, Yamato <[EMAIL PROTECTED]> wrote:
>
> -From "Re: So many MoGo run on cgos 9x9":
> >greenpeep also uses patterns derived from 2 UCT self-play games.
> >These are simple local patterns with scores that (roughly) indicate
> >the probability that the move at the center of the pattern wa
22 matches
Mail list logo
