turday, October 13, 2007 2:31 AM
Subject: Re: [computer-go] Former Deep Blue Research working on Go
How do I find the ones narrated in English? Do they exist? The
closest I could find was this one which is almost unwatchable.
http://www.youtube.com/watch?v=uArhCnJu7LM
On 10/12/07, Ray Tayek
At 04:31 PM 10/12/2007, you wrote:
How do I find the ones narrated in English?
not sure, i just found these things/
Do they exist?
yes
The
closest I could find was this one which is almost unwatchable.
http://www.youtube.com/watch?v=uArhCnJu7LM
all of the ones by her that i have seen a
How do I find the ones narrated in English? Do they exist? The
closest I could find was this one which is almost unwatchable.
http://www.youtube.com/watch?v=uArhCnJu7LM
On 10/12/07, Ray Tayek <[EMAIL PROTECTED]> wrote:
> At 07:36 AM 10/12/2007, you wrote:
> >Chris Fant wrote:
> > > Ho can I fi
At 07:36 AM 10/12/2007, you wrote:
Chris Fant wrote:
> Ho can I find Go vids on youtube? Searching for "go" obviously
does nothing.
>
>
Atari was also a good keyword here. There it is:
http://www.youtube.com/watch?v=qt1FvPxmmfE
searching for: go baduk weiqi
returns a bunch.
---
vice-chair
: [computer-go] Former Deep Blue Research working on Go
Chris Fant wrote:
> Ho can I find Go vids on youtube? Searching for "go" obviously does nothing.
>
>
Atari was also a good keyword here. There it is:
http://www.youtube.com/watch?v=qt1FvPxmmfE
--
Tapani Raiko, <[E
Or weiqi.
Peter Drake
http://www.lclark.edu/~drake/
On Oct 12, 2007, at 7:29 AM, steve uurtamo wrote:
try baduk!
s.
- Original Message
From: Chris Fant <[EMAIL PROTECTED]>
To: computer-go
Sent: Friday, October 12, 2007 10:04:23 AM
Subject: Re: [computer-go] Former Dee
Chris Fant wrote:
> Ho can I find Go vids on youtube? Searching for "go" obviously does nothing.
>
>
Atari was also a good keyword here. There it is:
http://www.youtube.com/watch?v=qt1FvPxmmfE
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
http://www.cis.hut.fi/praiko/
_
try baduk!
s.
- Original Message
From: Chris Fant <[EMAIL PROTECTED]>
To: computer-go
Sent: Friday, October 12, 2007 10:04:23 AM
Subject: Re: [computer-go] Former Deep Blue Research working on Go
Ho can I find Go vids on youtube? Searching for "go" obviously does not
Ho can I find Go vids on youtube? Searching for "go" obviously does nothing.
On 10/12/07, steve uurtamo <[EMAIL PROTECTED]> wrote:
> > Hi Steve,
> >
> > So this doesn't get too lengthy I'll remove the stuff I'm not responding
> > to.
>
> no problem.
>
> > But why would it suddenly go "log" at so
> Hi Steve,
>
> So this doesn't get too lengthy I'll remove the stuff I'm not responding
> to.
no problem.
> But why would it suddenly go "log" at some point nearby? This is the
> same superstition people had in computer chess for decades! Everyone
> had this gut feeling based on nothing what
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Steve,
So this doesn't get too lengthy I'll remove the stuff I'm not responding
to.
>> I think this statement is more or less true. Didn't you see the
>> scalability data for 19x19? In fact didn't you help me produce it?
>
> we tested some ve
> I think that is UCT and it's happening now. UCT is the most promising
> for 19x19 progress that we have now.
yes, it's new, and it's doing quite well. my hunch is simply that a few
thousand more ELO are not going to happen in hardware with this method.
> I think this statement is more or les
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Steve,
I don't fully understand what you are saying here.
steve uurtamo wrote:
> I think that there's an apples/oranges thing going on here.
>
>> My hunch, however, is that they won't play a
>> significant role in creating a machine that can top
I think that there's an apples/oranges thing going on here.
> My hunch, however, is that they won't play a
> significant role in creating a machine that can top the best human
> players in the 19-by-19 game.
i agree with this statement.
> And MC programs are more scalable that traditional progra
On Thu, 2007-10-11 at 18:37 -0400, Chris Fant wrote:
> Someone already did: Stone eater.
>
> On 10/11/07, terry mcintyre <[EMAIL PROTECTED]> wrote:
> >
> > Erik,
> >
> > It would be great to see Steenvreter on the 9x9 cgos server. BTW, can you
> > translate "Steenvreter" for us English speakers?
On 10/11/07, terry mcintyre <[EMAIL PROTECTED]> wrote:
> It would be great to see Steenvreter on the 9x9 cgos server.
It is still on my to do list...
> BTW, can you translate "Steenvreter" for us English speakers? Thanks!
It is a combination of the Dutch words "Steen" and "vreter". (Dutch
has t
Someone already did: Stone eater.
On 10/11/07, terry mcintyre <[EMAIL PROTECTED]> wrote:
>
> Erik,
>
> It would be great to see Steenvreter on the 9x9 cgos server. BTW, can you
> translate "Steenvreter" for us English speakers? Thanks!
>
> From: Erik van der Werf <[EMAIL PROTECTED]>
>
> Yes I'm h
Erik,
It would be great to see Steenvreter on the 9x9 cgos server. BTW, can you
translate "Steenvreter" for us English speakers? Thanks!
From: Erik van der Werf <[EMAIL PROTECTED]>
Yes I'm here :-) Sorry to have to disappoint you though, I have not
yet found enough time to work on 19x19. For n
On 10/11/07, Ian Osgood <[EMAIL PROTECTED]> wrote:
> I thought Steenvreter only played 9x9 Go. The 19x19 ICGA tournament
> winners were MoGo, CrazyStone, and GnuGo in that order.
How did I mess that up? Thanks for the correction.
___
computer-go mailing
: Re: [computer-go] Former Deep Blue Research working on Go
>
>
> On 10/11/07, David Fotland <[EMAIL PROTECTED]> wrote:
> > But the only way to settle this is to do some experiments. I could
> > certainly be wrong. If we have a mogo-many faces match on
> 19x19 c
Yes I'm here :-) Sorry to have to disappoint you though, I have not
yet found enough time to work on 19x19. For now the throne rightfully
belongs to Mogo.
Erik
On 10/11/07, Chris Fant <[EMAIL PROTECTED]> wrote:
> Can we also count on Steenvreter for this 19x19 smack-down? You out
> there, Erik
On Oct 11, 2007, at 1:49 PM, Eric Boesch wrote:
On 10/11/07, David Fotland <[EMAIL PROTECTED]> wrote:
But the only way to settle this is to do some experiments. I could
certainly be wrong. If we have a mogo-many faces match on 19x19
cgos, and
we also have them play for ratings against peop
Can we also count on Steenvreter for this 19x19 smack-down? You out
there, Erik?
On 10/11/07, Eric Boesch <[EMAIL PROTECTED]> wrote:
> On 10/11/07, David Fotland <[EMAIL PROTECTED]> wrote:
> > But the only way to settle this is to do some experiments. I could
> > certainly be wrong. If we have
On 10/11/07, David Fotland <[EMAIL PROTECTED]> wrote:
> But the only way to settle this is to do some experiments. I could
> certainly be wrong. If we have a mogo-many faces match on 19x19 cgos, and
> we also have them play for ratings against people on kgs, it would settle
> it.
Mogobot1 and mo
Message-
> From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Don Dailey
> Sent: Thursday, October 11, 2007 12:22 PM
> To: computer-go
> Subject: Re: [computer-go] Former Deep Blue Research working on Go
>
>
> -BEGIN PGP SIGNED MESSAGE-
> Hash:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Good common sense answer. I agree that this could be settled.
I'll go ahead and help Chris Fant set up a the server which he will
administer.
Meanwhile, can you experiment with the 9x9 server just to see if you can
get it working on CGOS?You ca
[EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Don Dailey
> Sent: Thursday, October 11, 2007 12:03 PM
> To: computer-go
> Subject: Re: [computer-go] Former Deep Blue Research working on Go
>
>
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> I thought Mo
;> From: [EMAIL PROTECTED]
>> [mailto:[EMAIL PROTECTED] On Behalf Of Chris Fant
>> Sent: Thursday, October 11, 2007 5:24 AM
>> To: computer-go
>> Subject: Re: [computer-go] Former Deep Blue Research working on Go
>>
>>
>> In your own paper you say:
>>
gt; From: [EMAIL PROTECTED]
> [mailto:[EMAIL PROTECTED] On Behalf Of Chris Fant
> Sent: Thursday, October 11, 2007 5:24 AM
> To: computer-go
> Subject: Re: [computer-go] Former Deep Blue Research working on Go
>
>
> In your own paper you say:
>
> "At the 19x19 level,
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Several points:
Null move is usually applied to a beta cutoff - but of course this is
mostly semantics. In the literature if you can "pass" (play the null
move) and still get a beta cutoff then you are in a fruitless line of
play because your opponen
On 10/9/07, Andrés Domínguez <[EMAIL PROTECTED]> wrote:
> 2007/10/9, Eric Boesch <[EMAIL PROTECTED]>:
> > Naive null move is unhelpful because throughout much of a go game,
> > almost every move is better than passing,
>
> I think this is not the point of null move. Null move is "if pass is good
>
gt;
> To: computer-go
> Sent: Wednesday, October 10, 2007 9:15:18 PM
> Subject: Re: [computer-go] Former Deep Blue Research working on Go
>
> I'm just now reading the article.
>
> "Monte Carlo techniques have recently had success in Go played on a
> restricted 9-by
no evidence that it will or can.
>
> s.
>
> - Original Message
> From: Chris Fant <[EMAIL PROTECTED]>
> To: computer-go
> Sent: Wednesday, October 10, 2007 9:15:18 PM
> Subject: Re: [computer-go] Former Deep Blue Research working on Go
>
> I'm just now reading the
Re: [computer-go] Former Deep Blue Research working on Go
I'm just now reading the article.
"Monte Carlo techniques have recently had success in Go played on a
restricted 9-by-9 board. My hunch, however, is that they won't play a
significant role in creating a machine that can top the
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Chris Fant wrote:
> I'm just now reading the article.
>
> "Monte Carlo techniques have recently had success in Go played on a
> restricted 9-by-9 board. My hunch, however, is that they won't play a
> significant role in creating a machine that can t
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
He is clearly posing for a picture, this is not a spontaneous
photograph. Notice the "Thinker" pose.
I'm not a good go player at all, but the board position seems a little
unnatural to me. But it could be my lack of experience.
Over the last few
Of no particular importance I suppose, but did any one else get the
impression after looking at the picture (and the way he is holding the
stone) that he is not a regular go player?
Chris Fant wrote:
I'm just now reading the article.
"Monte Carlo techniques have recently had success in Go pl
I'm just now reading the article.
"Monte Carlo techniques have recently had success in Go played on a
restricted 9-by-9 board. My hunch, however, is that they won't play a
significant role in creating a machine that can top the best human
players in the 19-by-19 game."
The author loses credibilit
At 02:33 PM 10/7/2007, you wrote:
Found this link and thought you all might find it interesting.
http://www.spectrum.ieee.org/oct07/5552
thread on slashdot: http://slashdot.org/article.pl?sid=07/10/10/1758244
---
vice-chair http://ocjug.org/
___
Quoting Rémi Coulom <[EMAIL PROTECTED]>:
Regarding the question of null move in Go, I remember that some
programmers who tried it in alpha-beta programs did not manage to
make it work (Peter MacKenzie comes to mind, maybe others). As Don
wrote, the main problem of null move is the depth reducti
> As Don wrote, the
> main problem of null move is the depth reduction. It hides long-term
> threats that the evaluation function might not be able to evaluate.
even with a very good evaluation function, i would think that another problem
(this is likely just restating what you and others have a
On 10/10/07, Don Dailey <[EMAIL PROTECTED]> wrote:
> In GO, threats tend to be very indirect and distant, at least from the
> point of view of a naive search algorithm and this is a real killer to
> the idea - my feeling is that null move in GO is not workable.
I have the same feeling. Some years
Rémi Coulom wrote:
Andrés Domínguez wrote:
2007/10/10, Don Dailey <[EMAIL PROTECTED]>:
Andrés,
You are right about null move of course. The assumption that other
moves are >= to the value of a pass is much stronger in GO than in
Chess, yet ironically it's not as effective in Go.
That
Andrés Domínguez wrote:
2007/10/10, Don Dailey <[EMAIL PROTECTED]>:
Andrés,
You are right about null move of course. The assumption that other
moves are >= to the value of a pass is much stronger in GO than in
Chess, yet ironically it's not as effective in Go.
That was what i was try
terry mcintyre wrote:
IIRC, a few Microsoft researchers did some interesting work with SVMs
and the prediction of pro-level moves. I've always wondered whether
that could be integrated with UCT to narrow the search tree.
Hi,
This is what I do in Crazy Stone:
http://remi.coulom.free.fr/Amster
2007/10/10, Don Dailey <[EMAIL PROTECTED]>:
>
> Andrés,
>
> You are right about null move of course. The assumption that other
> moves are >= to the value of a pass is much stronger in GO than in
> Chess, yet ironically it's not as effective in Go.
That was what i was trying to say. Pass is one o
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Andrés,
You are right about null move of course. The assumption that other
moves are >= to the value of a pass is much stronger in GO than in
Chess, yet ironically it's not as effective in Go.
- - Don
Andrés Domínguez wrote:
> 2007/10/9, Eric Boes
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Pass is just as good as a null move - it's the same and it isn't an
issue that hurts null move pruning.
But null move pruning isn't just about the null move. It's about the
subsequent search reduction that goes with it, otherwise it's no saving.
In
2007/10/9, Eric Boesch <[EMAIL PROTECTED]>:
> On 10/8/07, Tapani Raiko <[EMAIL PROTECTED]> wrote:
> > > May sound unpolite. But Deep Blue reached a very
> > > important step in IA. They will be known for ever.
> > > But, from a research point of view, they didn't much
> > > really. It was mainly a
On 10/8/07, Tapani Raiko <[EMAIL PROTECTED]> wrote:
> > May sound unpolite. But Deep Blue reached a very
> > important step in IA. They will be known for ever.
> > But, from a research point of view, they didn't much
> > really. It was mainly a technological/technical
> > achivement.
> >
> Maybe th
-- Original Message
From: Tapani Raiko <[EMAIL PROTECTED]>
To: computer-go
Sent: Monday, October 8, 2007 6:45:13 AM
Subject: Re: [computer-go] Former Deep Blue Research working on Go
> May sound unpolite. But Deep Blue reached a very
> important step in IA. They will be known
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Eduardo Sabbatella wrote:
> Deep Blue guy, but without cash, I don't see much to
> care about.
>
> May sound unpolite. But Deep Blue reached a very
> important step in IA. They will be known for ever.
> But, from a research point of view, they didn'
> May sound unpolite. But Deep Blue reached a very
> important step in IA. They will be known for ever.
> But, from a research point of view, they didn't much
> really. It was mainly a technological/technical
> achivement.
>
Maybe they will reimplement Mogo, try a null-move tweak, use a
superco
Deep Blue guy, but without cash, I don't see much to
care about.
May sound unpolite. But Deep Blue reached a very
important step in IA. They will be known for ever.
But, from a research point of view, they didn't much
really. It was mainly a technological/technical
achivement.
Don't trow me veggi
Oops sorry didnt realise.
On 10/7/07, Jeff Nowakowski <[EMAIL PROTECTED]> wrote:
> On Sun, 2007-10-07 at 17:33 -0400, Joshua Shriver wrote:
> > Found this link and thought you all might find it interesting.
> >
> > http://www.spectrum.ieee.org/oct07/5552
>
> Umm, this article was linked to and di
On Sun, 2007-10-07 at 17:33 -0400, Joshua Shriver wrote:
> Found this link and thought you all might find it interesting.
>
> http://www.spectrum.ieee.org/oct07/5552
Umm, this article was linked to and discussed heavily here within the
past week:
http://computer-go.org/pipermail/computer-go/2007
I thought it was an interesting article, full of gems and annoyances.
I couldn't help to get the feeling the author was poking fun at
Kasparov at times.
Despite that, I am curious to see what kind of hardware he and his
students produce. Guess if there is going to be a Deep Go he'd be the
one to
Quite interesting, but after all, it completely neglects the difficulties to
a) determine the life status of groups
b) build an evaluation function out of this
Benjamin
Joshua Shriver schrieb:
Found this link and thought you all might find it interesting.
http://www.spectrum.ieee.org/oct07/555
Found this link and thought you all might find it interesting.
http://www.spectrum.ieee.org/oct07/5552
Interesting part for me so far:
" At my lab at Microsoft Research Asia, in Beijing, I am organizing a
graduate student project to design the hardware and software elements
that will test the id
59 matches
Mail list logo
