I am sorry, but I think this discussion is a bit pointless.
While I write these 3 lines and you read them, AlphGo got 20 ELO
points stronger. :-)
Thomas
On Tue, 22 Mar 2016, Lucas, Simon M wrote:
Still an interesting question is how one could make
more powerful inferences by observing the
,...
Lukas
On Sun, Mar 13, 2016 at 12:20 PM, Clark B. Wierda wrote:
On Sat, Mar 12, 2016 at 5:05 PM, Thomas Wolf wrote:
Having AlphaGo playing exclusively on KGS would be such a boost to
KGS!
For sure.
The other Go servers might have their own opinion on that.
Clark
o just
being the first. And that has its own psychological challenges as the Go world
has many decades of
handling ELOs and rankings for humans. So, I don't think change in this area is
going to be welcomed
anytime soon.
On Sat, Mar 12, 2016 at 3:03 PM, Thomas Wolf wrote:
Ch
ke Ke Jie will though and we will find out.
On Mar 12, 2016 11:03 AM, "Thomas Wolf" wrote:
A suggestion for possible future games to be arranged between
AlphaGo and
strong players:
Whoever lost shall be given 1 stone or the equivalent of 1/2
stone handcap i
.
Finally, there are seki problems which I showed several professional players,
including famous 9p who could not tell whether the game was over or not.
Lot's of fun tests one could do.
Cheers, Thomas.
On Sat, 12 Mar 2016, "Ingo Althöfer" wrote:
Hi Thomas,
Von: "Thomas Wolf
A suggestion for possible future games to be arranged between AlphaGo and
strong players:
Whoever lost shall be given 1 stone or the equivalent of 1/2 stone handcap in
the
next game. Games should continue until each side has won at least once. This
way AlphaGo will be forced to demonstrate its f
Giant
hand-entered or game-learned joseki books?
Thanks,
steve
On Mar 10, 2016 12:23 PM, "Thomas Wolf" wrote:
My 2 cent:
Recent strong computer programs never loose by a few points.
They are either
rtamo ." wrote:
Quick question - how, mechanically, is the opening being handled by alpha
go and other recent very strong programs? Giant hand-entered or
game-learned joseki books?
Thanks,
steve
On Mar 10, 2016 12:23 PM, "Thomas Wolf" wrote:
My 2 cent:
Recent strong computer programs never loose by a few points. They are either
crashed before the end game starts (because when being clearly behind they play
more
desperate and weaker moves because they mainly get negative feadback from
their search with mostly loosing branches and ri
The next type of event could be a new 'Pair Go'
Where a human and a program make up a pair, like Mark Zuckerberg and his
facebook
program against a Google VP and alphaGo. :-)
Thomas
On Mon, 1 Feb 2016, John Tromp wrote:
For those of you who missed it, chess grandmaster Hikaru Nakamura,
rated
Congratulations to Aja $ DeepMind to that great result!
I am curious to see AlphaGo having to play a tough narrow endgame. In the
first of the 5 games it could affort not to play totally optimal in the end
and in the next 4 games Fan resigned. End games require again other, more math like
skill
On Fri, 22 Jan 2016, Adrian Petrescu wrote:
Very cool! I find it interesting that the number is only about 1.2% of 3^361
(though I realize 3^361 doesn't take symmetries into account).
On the surface it's counterintuitive to me that nearly 99% of random stone
configurations are not legal Go p
.
Gesendet: Sonntag, 17. Januar 2016 um 19:06 Uhr
Von: "Nick Wedd"
An: computer-go@computer-go.org
Betreff: Re: [Computer-go] Seki frequencies
There are some exotic sekis on this page by Denis Feldman:
http://denisfeldmann.fr/bestiary3.htm#p2
Nick
On 17 January 2016 at 16:04, Thomas
d).
Can you give an example for anti-seki?
Listing the possible configurations is a demanding open research field.
Perhaps you and someone like Thomas Wolf (with his life-and-dath background) would
be "the right" people for this question.
I have an (unpublished) talk abou
Hi Mark,
Thank you for the information. Unfortunately, I will not be able to attend
even though it is relatively close to my place. Would it be possible to submit
a paper and if accepted, a prerecorded talk?
Regards,
Thomas
On Sat, 16 Jan 2016, Mark Winands wrote:
Computer Games Workshop at
On Sun, 29 Nov 2015, Aja Huang wrote:
It's the work by Chinese pro Li Zhe 7p.
http://blog.sina.com.cn/s/blog_53a2e03d0102vyt5.html
His conclusions on 7x7 Go board:
1. Optimal komi is 9.0.
Who can enforce a win with this komi?
Thomas
2. Optimal solution is not unique. But the first 3 moves
Last move info is a cheap hint for an instable area (unless it is a defense
move).
Thomas
On Mon, 22 Dec 2014, Stefan Kaitschick wrote:
Last move info is a strange beast, isn't it? I mean, except for ko captures, it
doesn't really add information to the position. The
correct prediction rate i
nal games. Anyway, my question was whether people had published
any related tests.
Thomas
>
> David
>
> -Original Message-
> From: computer-go-boun...@computer-go.org
> [mailto:computer-go-boun...@computer-go.org] On Behalf Of Thomas Wolf
> Sent: Sunday, January 17, 2
published benchmarks need not be for a static evaluation function in the
traditional sense, they could be for an opening book or a MCTS program with
very short times available.
Thanks,
Thomas Wolf
___
computer-go mailing list
computer-go@computer-go.org
and making comments into a file.
I realize that MC programs are stronger in close games, so for each analysis
the number of prisoners might be adapted to get the best out of MC so that
from the analysis one can see where the player lost one or two points.
Thomas
On Mon, 5 Oct 2009, Thomas Wolf
A quick question:
What programs are useful for coaching a player by analysing the moves that
have been played in the endgame of some 19x19 game?
What one would want to do is to input the position, say 30 moves from the end,
and get a ranking of the remaining moves. It would be nice if it would no
On Wed, 13 May 2009, Isaac Deutsch wrote:
> Wow, you're fast to congratulate. ;)
>
> Congratulations from me, too.
From me 3. :)
Thomas
>
> Isaac
> --
> Neu: GMX FreeDSL Komplettanschluss mit DSL 6.000 Flatrate + Telefonanschluss
> für nur 17,95 Euro/mtl.!*
> http://dslspecial.gmx.de/fr
Is the 19x19 server down? (I wanted to look at some games.)
Thomas
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
On Sun, 15 Feb 2009, "Ingo Althöfer" wrote:
> Hello,
> ...
>
> When you follow this line of thought, the results of Tainan
> show that the computer go community will also now (and likely in
> future, too) have to fight with the problem/phaenomenon of quick
> human learning (as has been the case a
On Sun, 16 Nov 2008, Claus Reinke wrote:
> ...
> better feeling for the game; personally, I don't like fast games(*), but
> ...
But there is this saying:
"Play quick, lose quick, learn quick!" :)
Thomas
___
computer-go mailing list
computer-go@c
The typical situation is that two weak chains of opposite colours
attached to each other have their few liberties (in the extreme case
their single liberty) far apart. In simple Manhatten distance you can
have these liberties easily as distant as you want, but if you think
of empty points and chain
On Fri, 7 Mar 2008, Petr Baudis wrote:
> On Thu, Mar 06, 2008 at 04:33:16PM -0800, Dave Dyer wrote:
> >
> > To a first order approximation, would changing the komi change the
> > rankings? Presumably, programs are playing the same number of games
> > as black and white, so any "unfair" advanta
On Wed, 23 Jan 2008, Harald Korneliussen wrote:
> It turns out it's not the "bent four" shape, but I suspect it's
> another such shape, where more playouts only confirm that "these moves
> aren't worth including into the tree", so that UCT catches them very
> late, if ever.
Just a quick note tha
lgorithm... :-)
> >
> > our group is also the one that is doing JPC -
> > http://www-jpc.physics.ox.ac.uk/
> >
> > I'd love to hear about anyone else distributed attacks on Go.
>
> It would be great to see a java port of GoTools by Thomas Wolf[1],
> which is probab
Here are some pictures I just shot at the Computer Olympiade
and Computer Chess World Championship in Amsterdam.
http://lie.math.brocku.ca/twolf/htdocs/photos/35
userid: Amsterdam07
passwd: Kruislaan
Thomas
___
computer-go mailing list
computer-go@compu
> On 5/19/07, Thomas Wolf <[EMAIL PROTECTED]> wrote:
> > Here is another Amsterdam paper on Go, although about life & death
> > and not full game playing.
>
> I may be missing the obvious, but in Section 4.2, Diagram 13,
> isn't Black 10 a basic ko v
Here is another Amsterdam paper on Go, although about life & death
and not full game playing.
http://lie.math.brocku.ca/twolf/papers/bugsintro.ps
Thomas
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo
On Mon, 5 Feb 2007, Christoph Birk wrote:
> > > > > > > Why can't we use proper forums instead of this
> > > > > > > outdated list?
> > > > > > > Forums are easier to keep track of and search for
> > > > > > > messages. As a
> > > > > > > start we can use Yahoo groups. What do you think?
>
,
combinatorics and experience in computation as valuable strengths, this might
be of interest to someone on the email list. Together with a few students we
already have a small but active computer Go group at our math department.
Thomas Wolf
Prof at Department of Mathematics
Brock University
Ontario
On Tue, 9 Jan 2007, Chaslot G (MICC) wrote:
> Mango passes as soon as the opponent passes two times in a row.
> Might this lead to bugs in some situations?
You need 3 passes in case of ko.
Thomas
>
> Anyway this is very nice for playing against humans and GnuGo.
>
> Guillaume
>
> -Orig
game
theory, discrete optimization or anything else related to Go which I am
personally of course interested in. We might have a postdoc position in high
performance computing which can be closer to Computer Go in 2-3 months. So if
you are interested, please get in contact with me.
Thomas Wolf
[EMAIL
On Tue, 24 Oct 2006, Heikki Levanto wrote:
> On Tue, Oct 24, 2006 at 07:26:34PM +0100, Jacques Basaldúa wrote:
> > BTW: In my over 50K master games collection I have only seen 2 games
> > with a triple KO. (The whole collection was played out by GnuGo 3.6
> > level 10 to verify/compute the fina
Section 6 in http://lie.math.brocku.ca/twolf/papers/mono.pdf
is about chains with a single eye who's status is ko (the original
position does not have a ko-forbidden field) and where
passing is one of the best moves of both sides.
There also is a position at the end of the paper where the first tw
Our area has power cuts once in a while. :(
Thomas
On Sun, 22 Oct 2006, Don Dailey wrote:
> There is no bug, the server was apparently rebooted last night.
>
> It's up and running now.
>
> - Don
>
>
> On Sun, 2006-10-22 at 12:14 +0200, [EMAIL PROTECTED] wrote:
> > Hello,
> >
> > I have
39 matches
Mail list logo
