Wow that is... astonishing. Thanks for the post Ingo!
This reddit is later on linked in the forum and includes speculations
that it's not AlphaGo based on answers in similar positions. I'd
disagree though - no whole game is the same and AlphaGo evolves and
changes so much still through self-play.
Hi everyone,
long time reader, sometimes poster.
I gave a talk last week at Full Stack Fest about Computer Go and the
advances that AlphaGo brought (but about MCTS as well of course). It's a
40mins presentation so I had to cut a lot. I think it's a good
introduction and the talk was well received
Wow, congrats to the AlphaGo team! Would love to see a more detailed
analysis later today.
On Mar 9, 2016 9:55 AM, "Marc Landgraf" wrote:
> It was pointed out by Lee Sedol after the game and Kim Myungwan during
> the game, that Q5 should have been better at R4. I would say this was
> the final st
Hi there lovely computer-go mailing list,
I gave a presentation titled "Beating Go Thanks to the Power of
Randomness" at Rubyconf 2015. It is a full introductory talk which means:
* the rules of Go are introduced (leaving out Ko and seki though.. time)
* the discussion of MCTS is on a very high l
If you remove the limit on the tree size, does this still occur?
Otherwise, I agree with Gonçalo - it seems unlikely. When I implemented
Double Step [1] and had weird results I forgot to switch the perspective
of the bots and even worse some of the move generation was buggy.
Cheers,
Tobi
[1] a t
Thanks for that observation Nick!
For those that don't want to look for themselves:
https://www.gokgs.com/gameArchives.jsp?user=darkforest
https://www.gokgs.com/gameArchives.jsp?user=darkfores1
>From a quick look it seems like it is winning most of its games, even
against 1d/2d players, but ther
, otherwise
> I'd reference it. Hopefully somebody else can give the reference. I
> suspect David probably co-authored the paper in which case apologies
> to the other author for not crediting them here!
>
> I hope this helps
>
> Regards
>
> Raffles
>
> On 03-
Hi everyone,
I haven't yet caught up on most recent go papers. If what I ask is
answered in one of these, please point there.
It seems everyone is using quite heavy playouts these days (nxn
patterns, atari escapes, opening libraris, lots of stuff that I don't
know yet, ...) - my question is how d
Hi everyone,
haven't seen this on the mailing list yet (well anything after the
second game), but the code centric go challenge is over, the last game
was played yesterday. FJD won the best of five 3-1 only losing the first
game.
More information here: https://go.codecentric.de/
Congrats to Fran
Hi there,
I started on a JavaScript engine quite some time ago :) At the time for
a Mozilla competition but didn't quite complete it. It is already
parallelized through web workers (performance + otherwise you get the
busy JS popup etc.).
https://github.com/PragTob/web-go
It is written in Coffee
thanks for this link, there are some really interesting papers there :)
On 27.09.2015 03:10, Hiroshi Yamashita wrote:
> His paper is also interesting.
> Abakus got +130 Elo by online learning.
>
> Adaptive Playouts in Monte Carlo Tree Search with Policy Gradient
> Reinforcement Learning
> https://
11 matches
Mail list logo