Pictures of the charts are available here:
https://www.reddit.com/r/baduk/comments/4cgitz/alphagos_confidence_chart_for_the_5_games_david/
?
They're hard to read in detail but they still give a good impression of how
the evaluation developed during the games.
On Wed, Apr 20, 2016 at 11:26 AM,
There's a discussion of some of the issues in Petr Baudis' PhD thesis:
http://pachi.or.cz/
On Sun, Apr 10, 2016 at 9:19 AM, Jean-Francois Romang
wrote:
> Hello to everyone ; I'm a newcomer in this list and computer go
> programming. I have a chess programming background,
Alternatively, there's a minimalist Python MCTS engine (
https://github.com/pasky/michi) that might be easier to translate. It has
no UI though, so that would need to be added.
On Thu, Mar 17, 2016 at 9:47 AM, Gian-Carlo Pascutto wrote:
> On 16-03-16 22:17, Clark B. Wierda
If you look back through the archive on this list, you'll also see there
was an initial attempt, described here:
http://computer-go.org/pipermail/computer-go/2015-October/008067.html
code is here: https://github.com/PragTob/web-go
On Thu, Mar 17, 2016 at 4:46 PM, Oliver Lewis <oj
Is the paper still available for download? The direct link appears to be
broken.
Thanks
Oliver
On Wed, Feb 3, 2016 at 2:06 AM, Igor Polyakov
wrote:
> I think it would be an awesome commercial product for strong Go players.
> Maybe even if the AI shows the
It sounds like you are trying to develop a (fancy) client rather than a
bot, so you won't need knowledge of life and death, TT rules etc... I think
working through the GTP protocol and making sure you can handle all the
commands will give you the best checklist. Here is the draft:
-16 11:58 GMT+00:00 Oliver Lewis ojfle...@yahoo.co.uk
javascript:_e(%7B%7D,'cvml','ojfle...@yahoo.co.uk');:
It's impressive that the same network learned to play seven games with
just a win/lose signal. It's also interesting that both these teams are in
different parts of Google. I assume
Although the number of games explored is very limited relative to the total
number of possible games, those games are in some sense representative of
what happens if you start with a particular move. That's why they can help
to create a ranking that tells you something about which moves are
Thanks Don, for CGOS to date and for the planned expansion. Please keep up
posted how much you raise.
On 7/31/08, Don Dailey [EMAIL PROTECTED] wrote:
Ok, some news. I'm going to put a donate button on the CGOS website.
We are going to use any donations to help Dave Dyer upgrade his server
Orego version 3 in Java (before the C++ rewrite and the optimisation for
Monte Carlo / UCT) was really simple to understand and add new players to.
Perhaps Peter Drake can reinstate the link from his site - otherwise I can
email you a copy.
On 7/28/07, Jeff Nowakowski [EMAIL PROTECTED] wrote:
It seems important to have some way of measuring how good / settled the
current best move is, particularly if you're also going to think in your
opponent's time. Otherwise, you could end up spending significant amounts
of allocated time when, for example, a sequence of forced moves is being
correct. We have British Summer Time (GMT+1) from Spring to Autumn (Fall),
so the Mac widget probably adjusts for that.
On 1/1/07, Peter Drake [EMAIL PROTECTED] wrote:
An interesting report.
I have a question about a line near the end where you address the two
meanings of UCT:
UCT as
12 matches
Mail list logo