On 19x19, Erica's speed is around 5,500 lightweight playouts per second on a
single i7 cpu. As far as I know, Lukasz Lew's libego, which is open source,
is the fastest implementation of MCTS and can reach around 6,000-7,000
lightweight playouts per second in the same cpu.
Aja
-原始郵件-
, 2011 at 10:23 PM, Aja Huang ajahu...@gmail.com wrote:
On 19x19, Erica's speed is around 5,500 lightweight playouts per second on a
single i7 cpu. As far as I know, Lukasz Lew's libego, which is open source, is
the fastest implementation of MCTS and can reach around 6,000-7,000 lightweight
Rémi
On 28 oct. 2011, at 06:30, Aja Huang wrote:
No, I meant 6,000-7,000 playouts per second on 19x19.
Aja
From: Michael Williams
Sent: Thursday, October 27, 2011 5:18 PM
To: computer-go@dvandva.org
Subject: Re: [Computer-go] MCTS playouts per second
Perhaps you meant to say 60,000-70,000
In the UEC Cup last weekend, I rented a machine from Amazon EC2 to run
Erica:
High-CPU Extra Large Windows Instance (c1.xlarge) $1.16 per/hour
(High-CPU Extra Large Instance 7 GB of memory, 20 EC2 Compute Units (8
virtual cores with 2.5 EC2 Compute Units each), 1690 GB of local instance
By the way, they charge $0.02/hour for running a Micro Windows Instance.
Aja___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
I just gave a quick try. The current version of Erica scores 75.4%(±3.2)
against GnuGo 3.8 Level 10 on 9x9, with 300 playouts/move. It can be even
stronger since the parameters are well tuned for 19x19 but not 9x9. I think
Zen and Crazy Stone can reach higher winning rate.
Aja
From: Brian
I have played several games with the 5 dan CrazyStone (24 cores) and felt
that it is pretty close to the 5 dan Zen (26 cores) in playing strength. In
fact, CrazyStone’s playing style is much more balanced and human-like than
Zen. Specifically, CrazyStone is better than Zen at winning without
No long ago I was considering a scheme something like bias uct formula by
solid points to cure the problem of underestimation of the edge and
corner territory, but still have no time to try. I believe it is one of the
solutions to the notorious problem that MCTS programs usually like center
have to
use the information of “location” from the “ownership map” (looks to me a
nice word).
Aja
From: Don Dailey
Sent: Monday, January 09, 2012 11:24 AM
To: Aja Huang ; computer-go@dvandva.org
Subject: Re: [Computer-go] replacing dynamic komi with a scoring function
On Mon, Jan 9, 2012 at 12
Interesting. I have observed a problem in the current dynamic komi scheme
especially when there is a big semeai/life-and-death:
Playout 1 B+0.5
Playout 2 B+0.5
Playout 3 B+0.5
Playout 4 B+0.5
Playout 5 B+0.5
Playout 6 B+0.5
Playout 7 B+0.5
Playout 8 B+0.5
Playout 9 B+0.5
but still have no time to try it.
Aja
From: Stefan Kaitschick
Sent: Monday, January 09, 2012 2:28 PM
To: Aja Huang ; computer-go@dvandva.org
Subject: Re: [Computer-go] replacing dynamic komi with a scoring function
The correct answer is 0, because shifting by just 1 point drops the rate to 10
When a program becomes famous/interesting on KGS, some users would try to
play with it. I have seen that one guy registered a new account and used
that account to beat Zen from 6 stones until 2 stones. Now sure if it hurts
Zen's rating much. Just now I saw an account StoneCrazy [4d] on KGS
Hi Vlad,
Do you mean the case in the attached example semeai_scoring.sgf? In a seki
of a dead group with a square of four, the other side must have a big eye as
well. The bottom-right corner is such an example, where it's all White's
territory. In the bottom-left corner. It can't be a seki.
In the last UEC Cup, the Japanese program katsunari played with mirror Go
strategy against Zen, Fuego and ManyFaces. katsunari lost all three games.
http://jsb.cs.uec.ac.jp/~igo/eng/result_2nd/Zen-katsunari.sgf.html
http://jsb.cs.uec.ac.jp/~igo/eng/result_2nd/katsunari-Fuego.sgf.html
5:33 PM
To: Aja Huang ; computer-go@dvandva.org
Subject: Re: [Computer-go] Zen blunder in long mirror go game
I think that the main problem was not winning or losing a mirrored game but
the blunder in late endgame by playing suicidal move. Perhaps Zen was losing
the game, so this was the reason
OK, I see your point. So it should be Yamato reply the question if he like.
:)
Aja
From: Jouni Valkonen
Sent: Monday, January 16, 2012 6:45 PM
To: Aja Huang ; computer-go
Subject: Re: [Computer-go] Zen blunder in long mirror go game
Aja, you are talking something that has zero relevance
A simple solution would be to keep a variable HandicapStone.
In the function of GTP command play:
If (WhiteNeverPlayed == true) // WhiteNeverPlayed is initialized to true
{
if (Color == BLACK
Move != PASS)
HandicapStone += 1.0f; // HandicapStone is initialized to 0
else
-
From: Aja Huang
Sent: Saturday, January 21, 2012 12:54 PM
To: computer-go@dvandva.org
Subject: Re: [Computer-go] KGS, gogui and handicap stones
A simple solution would be to keep a variable HandicapStone.
In the function of GTP command play:
If (WhiteNeverPlayed == true) // WhiteNeverPlayed
You should let me try. :)
Aja
From: David Fotland
Sent: Saturday, January 28, 2012 6:45 PM
To: computer-go@dvandva.org
Subject: Re: [Computer-go] Beating old ManyFaces at 29 handicap stones
I tried 29 stones once and it crushed me J
David
From: computer-go-boun...@dvandva.org
@dvandva.org
Subject: Re: [Computer-go] Beating old ManyFaces at 29 handicap stones
Awesome attempt!
285 at R8 and you would have crushed it in the first try.
Stefan
On Sun, Jan 29, 2012 at 2:47 AM, Aja Huang ajahu...@gmail.com wrote:
You should let me try. :)
Aja
From: David Fotland
Sent
I tried 3 games with Erica:
http://www.gokgs.com/gameArchives.jsp?user=Erica19B
In the 1st, 2nd games, Erica was running with 5k playouts/move (1 thread)
and Erica lost both games.
In the 3rd game, Erica was running with 2 threads and 10s/move (around
15-20k playouts/move). Erica won.
My
:
Awesome attempt!
285 at R8 and you would have crushed it in the first try.
Stefan
On Sun, Jan 29, 2012 at 2:47 AM, Aja Huang ajahu...@gmail.com wrote:
You should let me try. :)
Aja
From: David Fotland
Sent: Saturday, January 28, 2012 6:45 PM
To: computer-go@dvandva.org
Hi Xaryl,
Surprised that Pachi's ladder code can't detect common second line kill like
this:
.X.
XOX
...
###
But note in certain tactical situations it’s good to ladder-extend from the
second line:
http://senseis.xmp.net/?TwoStoneEdgeSqueeze
Aja
From: Xaryl C
Sent: Wednesday, February 15,
Hi Leandro,
Glad to hear your interesting result as well as Zen's great achievement.
But the website seems down. Could you please check it? Thanks.
Regards,
Aja
2012/3/17 Leandro Marcolino soria...@usc.edu
Hello all!..
Last year I proposed an improvement over current MCTS algorithms that
I
at 6:54 PM, Aja Huang ajahu...@gmail.com wrote:
Hi Leandro,
Glad to hear your interesting result as well as Zen's great achievement.
But
the website seems down. Could you please check it? Thanks.
Regards,
Aja
2012/3/17 Leandro Marcolino soria...@usc.edu
Hello all!..
Last
On 9x9 Erica now scores about 85% on 300 playouts / move against GnuGo 3.8
Level 10, around of rating 2100. From current CGOS results looks like Crazy
Stone is much stronger. :)
Aja
2012/4/24 ds d...@physik.de
Thanks a lot,
there is a long way to go for us with this impressible strength:)
Dear all,
Martin Mueller and I are writing a paper about exploring some limitations
of current MCTS programs in Go. For this purpose we have carefully designed
a regression test set which consists of 20 seki and 15 two-safe-groups
cases on 9x9 board. If you are interested, it is available at
Hi Jacques,
We will appreciate very much if you could participate in our test. In the
specification of GTP, about the command 'loadsgf' it says
Board size and komi are set to the values given in the sgf file. Board
configuration, number of captured stones, and move history are found by
replaying
By the way, to use gogui-adapter to translate 'loadsgf' the command is
something like
./run.sh -p java -jar gogui-adapter.jar \PATH_TO_PROGRAM \ -t
g_seki_moves.tst
(use backslash character (\) to escape the quotes in the string)
I used gogui-adapter to run pachi and Mogo as well because they
Hi Olivier,
Yes that's our plan. We will appreciate very much if you could participate
in our regression test and contribute Mogo's results. It will be
interesting to see Mogo's performance of these test cases on large
simulations like 1M, 2M, 4M or even 32M over a mega cluster/strong machine.
Hi Rémi,
Yes, you are right. Case11 is not correct. I have fixed it. Case19 is
Hanezeki that might never occur in real games. The purpose of this search
is to explore some limitations of current MC Go programs so Martin asked me
to design the most difficult seki cases on the earth. Then I just
Thanks, it is indeed a very interesting seki. In case13 the seki at the
bottom-left corner is also formed in a big eye but of a different shape.
Aja
You'll find in attachment an interesting case of seki that maybe you don't
have in your database. The White string in A11 has 3 liberties, but W
Dear all,
If you are interested, you can download our latest regression test set at
http://webdocs.cs.ualberta.ca/~shihchie/seki-and-two-safe-groups-regression-test.zip
which was updated with
1. Newest, bug-free gogui-adapter.jar.
2. Fixed case11.sgf of the seki test set.
3. genmove version of
In case of MCTS, a simple and cheap way is to detect superko as output
filter and use next best move in the tree if superko violation is
detected; however, some situations may be significantly misread because
of that. The other extreme is detecting and avoiding superko even in
simulations;
Ya, I agree with you all. In fact, four-move cycle is just a basic type of
superko, see
http://senseis.xmp.net/?Cycle
I never managed to prohibit moves that form a cycle of length over six.
because I thought cases other than triple ko might occur rarely. But it
might be worth a try to handle
Hi Nick,
I found that KGS sends wrong time_left commands for the byo-yomi time
control. For instance, in this TCGA 13x13 computer Go tournament with time
setting 0:00+3x0:12(byo-yomi), Fuego received the command from the server
time_left w 12 3
which means 12 secs are remained for 3 moves, as
I just realized that it is Lukasz Cup. :)
Aja
___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
In such a competition techniques like dynamic komi become extremely
important. A program must endeavor to earn more points even if the best
result is 0.5 point loss. Interesting.
Aja
Whether a bot loses to CrazyStone by 10 points or 20 tells us more
about its skill than whether it beats break
LinkedIn
I'd like to add you to my professional network on LinkedIn.
- Aja
Aja Huang
Post-Doc at University of Alberta
Edmonton, Canada Area
Confirm that you know Aja Huang:
https://www.linkedin.com/e/8s9wxs-h5de7ee0-5q/isd/8083456779/4mQAfMb2/?hs=falsetok=2HknsJLQ1ZN5k1
--
You
This seki can be easily handled by forbidding White's self-atari at T9 and
S10, which are apparently bad moves because Black's S11 group has a solid
real eye at R16.
Aja
2012/8/15 Nick Wedd n...@maproom.co.uk
Yesterday, a KGS game between Blubbel 3d and AyaBot4 2k, SGF file
below, ended with
5. Score: The winning bot gets 1 points and each bot gets 0.5 point if
the result is draw.
Can the result be a draw?
Rémi
On September 5, two top Go players Lee Sedol and Gu Li played a game ended
in a quadruple ko, see
http://gogameguru.com/quadruple-ko-group-of-death-17th-samsung-cup/
Dear all,
Is there any Go software on OS X like MultiGo on Windows that I can view
and edit .sgf game records?
Thanks,
Aja
___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
2012/11/23 Hideki Kato hideki_ka...@ybb.ne.jp
How about qGo (http://qgo.sourceforge.net/)?
#I never use it but many Mac users in Japan prefer.
Thanks, but the .dmg doesn't work for me. I'm running OS X 10.8.2.
It says
You can't open the application qGo because PowerPC applications are no
2012/11/23 Rémi Coulom remi.cou...@free.fr
You can use gogui.
Yes, thanks. GoGui seems the best choice.
Aja
___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
Thanks all. I have successfully viewed Zen's H4 game on Mac OS X. :)
Cheers,
Aja
2012/11/23 Hideki Kato hideki_ka...@ybb.ne.jp
qGo is an open source (GPL) program.
Hideki
Aja Huang: CALQB9_=
04ex0ksonoj4ecj8hu9kb7q3ts7f34ozymn6nw3d...@mail.gmail.com:
2012/11/23 Hideki Kato hideki_ka
In game 3 (Zen as W vs. So 8p), I don't understand why Zen didn't simply
extend at G8 (move 24). That would be an easy win if Zen lived a group at
that corner.
Aja
2012/12/2 Hiroshi Yamashita y...@bd.mbn.or.jp
Hi,
Zen lost six games against pros in 9x9 on November 25.
Each three pros played
2012/12/2 Erik van der Werf erikvanderw...@gmail.com
It doesn't look that easy to me. Have you tried playing it against Erica?
No, I haven't set up Erica in this laptop.
Another question: how about W H4 instead of H2 for move 28? The corner
looks completely alive to me. Even if B has a
Hi Ingo,
2012/12/12 Ingo Althöfer 3-hirn-ver...@gmx.de
Hi Martin,
thanks for the hint. Unfortunately, at the moment I can not
download from that site (unexpected error).
You could try here
https://era.library.ualberta.ca/public/datastream/get/uuid:9e921da9-5176-4327-be53-43b8dec5d1ac/DS1
See http://senseis.xmp.net/?EvenSizedBoards
Aja
On 7 Jan 2013, at 08:08, Ingo Althöfer 3-hirn-ver...@gmx.de wrote:
Go is traditionally played on boards of odd sizes (9x9, 13x13, 19x19, ...)
and almost never on even ones (10x10 or 18x18 ...). What are the reasons
for this?
Ingo (has
2013/1/7 David Ongaro david.ong...@hamburg.de
Hi,
Go really isn't traditionally played on 9x9 and 13x13. They where
introduced in recent times to make teaching easier. The traditional board
sizes are 17x17 and 19x19. The reason for odd sizes is simple: even sizes
lag a tengen which is quite
Congratulations to Crazy Stone! The two games between CS and Zen are quite
exciting.
Thanks for the report, Nick. I hope you'll get well soon.
Aja
2013/1/15 Nick Wedd n...@maproom.co.uk
Congratulations to Crazy Stone, undefeated winner of Sunday's
19x19 bot tournament!
My (very short)
A command something like
rule_set japanese
might be good. Other rule sets such as Ing and AGA are also popular, see
http://senseis.xmp.net/?RulesOfGo
Aja
2013/2/23 ds d...@physik.de
If my version of the gtp protocol is the latest, there is no command for
scoring (it is in the missing
For the Japanese rules, you can find what I did in Erica at
http://www.mail-archive.com/computer-go@dvandva.org/msg00195.html
For seki, simply ignore all empty points *connected* with seki groups.
Aja
2013/2/22 Martin Mueller mmuel...@ualberta.ca
I want to support Japanese rules in Fuego for
Now it seems to me that this is related to the way playouts are done
and it will be difficult to improve with Mogo style (rule-based)
playouts above certain strength, without using larger patterns and next
move choice based on probability distribution. Currently, playing out
a simple joseki
2013/3/8 ds d...@physik.de
Can you provide a link to your thesis, as the one I found is dead:)
Thanks Detlef
http://www.grappa.univ-lille3.fr/~coulom/Aja_PhD_Thesis.pdf
Aja
___
Computer-go mailing list
Computer-go@dvandva.org
place of
our web site in a few days.
Masakazu Muramatsu
2013/3/17 Aja Huang ajahu...@gmail.com:
Thanks Martin. Good luck to 2000-core Fuego. :)
Aja
2013/3/16 Martin Mueller mmuel...@ualberta.ca
I wrote a brief report for the first day from MP-Fuego's point of view
on
http
Congratulations to Rémi and Crazy Stone!
Thanks Martin. The attached game is really funny. Looks like both Fuego and
Nomitan overlooked B's T10 and Fuego found it first. Nomitan would have won
if it played T17. I'm impressed by Fuego's fighting spirit throughout the
whole game.
Aja
2013/3/17
Dear all,
If you are interested, you can download the newest version of our
regression test set (seki and two-safe-groups) at
http://webdocs.cs.ualberta.ca/~shihchie/seki-and-two-safe-groups-regression-test.zip
or in Fuego svn
http://fuego.svn.sourceforge.net/viewvc/fuego/trunk/regression/name
See the games here with a nice GUI,
Ishida Yoshio 9p(W) vs. Zen(B), W+R
http://lgs.tw/qyqw7kk
Ishida Yoshio 9p(W) vs. CrazyStone(B), B+3.5
http://lgs.tw/q4xo04m
Aja
2013/3/20 remi.cou...@free.fr
Thanks Petr for your report. Attached is my sgf of the game with
Ishida-sensei.
Rémi
-
In the opening, Zen as usual traded a lot of *cash*(territory) for *a
cheque*(the big center). Though this style is far from the current
mainstream of the human Go world, it is, however, in accordance with Zen's
fighting-oriented playing-style and strategies. Some moves are
questionable: N4(72)
2013/3/26 Hiroshi Yamashita y...@bd.mbn.or.jp
My anti-semeai version Aya gets
Aya 7/15 46% (anti-semeai)
Aya 1/15 6% (normal)
But I could not get good result on KGS and selfplay from anti-semeai.
Its strength is almost same. Maybe side-effects?
One possibility might
The attached example shows that a *good rule* might break the balance of
playouts and produce a worse evaluation.
Suppose in the playout we add a new rule to forbid B's D1 self-atari. This
rule makes sense since D1 is a completely meaningless suicide in terms of
Go knowledge. But, in fact, this
To effectively apply RAVE data to the playouts, we must come up with a new
idea to incorporate the information of move sequences into RAVE. The main
weakness of the AMAF principle is its lack of sequential consideration. And
that is NOT an easy problem.
In the attached example, W's winning moves
1 - finding the local fights causing secondary modes in the
distribution by statistical analysis accross terminal nodes
2 - solving the local fight separately
3 - twining the solution (the local game tree) in the global search (game
tree) in a way that looks like Conway's methods in Winning
Hi Brandon,
To start Fuego, run the binary *fuego* under /build/opt/fuegomain:
.../build/opt/fuegomain$ ./fuego
Fuego 1.1.SVN
Copyright (C) 2009-2012 by the authors of the Fuego project.
This program comes with ABSOLUTELY NO WARRANTY. This is
free software and you are welcome to redistribute it
Fuego has lots of regression tests available for many kinds of scenarios.
see
http://fuego.svn.sourceforge.net/viewvc/fuego/trunk/regression/
Regards,
Aja
2013/4/19 Ben Ellis ben.el...@softweyr.co.uk
All,
Does anyone have a set of SGFs with common use-cases or problem
scenarios to
Probably you have to login as Orego60 and check *Rank* in the profile.
Aja
2013/5/12 Peter Drake dr...@lclark.edu
I can't figure out what's different. Below is my configuration file at the
moment. Any other suggestions?
name=Orego60
password=***
room=Computer Go
automatch.rank=4k
map is very slow. Maybe you should use a vector instead.
Aja
2013/5/18 ds d...@physik.de
Thank you so much!
That is what I wanted to do in the first place, but I have problems to
do it right.
The circular patterns are stored in a std::mapCircPatt , int
Now I learned, that c++11 has some
2013/5/18 ds d...@physik.de
Thanks Aja,
in this case I can't I think. Here I look up the large patterns: I could
replace it with some kind of hash table, but this is probably not much
easier to initialize at compile time?
By initializing at compile time, I think they just meant something
Hi David,
2013/6/24 David Briemann dbriem...@gmail.com
To give you an impression, this is what it looks like in fuego for a well
known opening position: http://www.abload.de/img/board7brdj.png
So what is puzzling me right now is this: Even if I limit the possible
playout moves to the best Y
2013/6/24 David Briemann dbriem...@gmail.com
I'm beginning to think that I didn't understand the tree search part
correctly. You say the tree search generates moves too. I thought moves
were only generated in playouts and the tree search part was to follow
already played lines until it
2013/8/14 Petr Baudis pa...@ucw.cz
Aya 1 1 0 0 1 1 1 1 064
Amigo 1 1 1 0 1 1 0 1 064
I'm curious about Amigo - has this program seen any new recent
development? As far as I remember, this used to be a rather old and weak
I didn't get Don's goodbye message as well, and I found Gmail filtered lots
of emails from the list as spams.
Aja
2013/10/9 Erik van der Werf erikvanderw...@gmail.com
On Wed, Oct 9, 2013 at 8:54 PM, Ingo Althöfer 3-hirn-ver...@gmx.de
wrote:
Ps. Sorry for writing this as a new message. But
Hi all,
2013/10/10 Lars Schäfers sl...@upb.de
3) two-safe-group
It is a term used by Aja Huang to describe a class of Go positions he
created, that contain two safe but not yet completely settled groups.
The positions were created with the aim to be difficult to understand
for current MC
2013/11/1 Rémi Coulom remi.cou...@free.fr
In MCMC the distribution is given to you with some kind of mathematical
definition, and the challenge is to create a Markov Chain that approximates
the distribution well.
In MCTS what we really want is a good playout policy and we sample (do
2013/11/15 Hiroshi Yamashita y...@bd.mbn.or.jp
I agree with you.
.OO.
OXXO snap back
XO.O
.XO.
For example, Aya often took one O stone before. It is useless.
I added the feature Take snap back when there is no ko, its gamma
was 0.009, very low. After that, this move is rarely
Thanks Nick. I'm impressed by Martin's comments. :)
Aja
2013/12/9 Nick Wedd n...@maproom.co.uk
Congratulations to Crazy Stone, winner of yesterday's 13x13 KGS
bot tournament!
My report is at http://www.weddslist.com/kgs/past/98/index.html
As usual I will be grateful for your comments and
In round 3 CrazyStone vs. Aya, probably Aya was expecting W to play L12 or
N12, if B's corner was not 100% dead in the playouts. It seems a bug in
Aya's playouts, but even if there was no bug, Aya could still reasonably
expect W's L12 or N12 in the tree. Corner bent-four is not easy to handle
W can't play N12 if B has more than one external-lib since B will live
unconditionally, as the attached example shows.
Aja
2013/12/9 Hiroshi Yamashita y...@bd.mbn.or.jp
In round 3 CrazyStone vs. Aya, probably Aya was expecting W to play L12 or
N12, if B's corner was not 100% dead in the
2013/12/10 Darren Cook dar...@dcook.org
If you had four bent-fours, one in each corner, all dead in Japanese
rules for the same colour, *and* four un-removeable ko threats, is that
the position that will give the biggest difference in score between
Japanese and the other scoring methods?
I made a test case with four bent-fours and seki. To break the seki at
center, at least one of the bent fours must be practically solved. Would be
interesting to see a Go program's behavior in this position. :)
Aja
2013/12/10 Darren Cook dar...@dcook.org
I am afraid can depend on rule set in
I have registered the weekend tournament (
http://egc2014.com/congress/the-weekend-tournament/).
http://egc2014.com/registered-players/
36 AjaHuang 4d City of London Go Club, http://www.citygoplayers.o
I'll offer free, face-to-face teaching games to the interested participants
from this list.
Thanks Nick for the report. I'm impressed by DolBaram's performance, in
particularly it was using a weaker hardware and scored 1 win, 1 loss and 3
draws against Zen.
As you pointed out, seems Zen has a bug on Chinese scoring
Hi Hiroshi,
Maybe it's worth trying never fill own sure territory in the playouts
except replying to opponent's move. That is to say, after certain number
(say 64) of playouts if the territory belongs to one side exclusively (say
99% of the playouts) then from the next playout don't fill the
+00:00 Aja Huang ajahu...@gmail.com:
Hi Hiroshi,
Maybe it's worth trying never fill own sure territory in the playouts
except replying to opponent's move. That is to say, after certain number
(say 64) of playouts if the territory belongs to one side exclusively (say
99% of the playouts
Hi Mikko,
Welcome to the list.
2014-03-16 18:35 GMT+00:00 Mikko Aarnos mikko.aar...@kolumbus.fi:
1. On single-point eye detection: how is this generally done? I first used
the definition that we have a single-point eye if a point has only our
stones as neighbours and at most 1 diagonal
The speed of your program would mostly depends on what features you want to
support and what data structures you decide to incrementally maintain in
the lowest level. Back in 2010, in Erica I got only about 5000-6000 pure
random playouts per second on 19x19 at one 2.26 GHz core. For me what
really
Hey Marc,
2014-04-30 8:37 GMT+01:00 Marc Landgraf mahrgel...@gmail.com:
Hi,
my bot is still under construction, but written entirely under C++11. So
few comments:
General:
Most compilers, especially if you are using Windows, still have problems
with C++11 and it's new multithreading
Studio and
Visual C++ I can't handle properly.
And with Code::Blocks, I fooled around with various versions of GCC, and
ended with mingw-w64, which gave me by far the best performance among those
supporting the for me relevant C++11-features.
Marc
2014-04-30 11:01 GMT+02:00 Aja Huang ajahu
Hey Marc,
It is a common question against supervised learning. I recommend reading
about bias-variance dilemma.
http://en.wikipedia.org/wiki/Bias-variance_dilemma
Aja
2014-05-19 19:10 GMT+01:00 Marc Landgraf mahrgel...@gmail.com:
Hi,
Today I had an interesting discussion about bots
Thanks Nick.
Interestingly, looks like the ranking is strongly correlated with the
hardwares. :)
1. Zen19S 50 cores
2. stv 46 threads
3. CrazyStone 24-core
4. Fuego9 12-core
5. AyaMC 6-core
NiceGo, GnuGo and MCark were all running on small hardwares.
Aja
2014-06-03 15:52 GMT+01:00 Nick
2014-06-05 13:54 GMT+01:00 Stefan Kaitschick stefan.kaitsch...@hamburg.de:
If a bot is deluded, it will go to work with that delusion on any
position. I think it's actually more useful to study positions that
are especially susceptible to this behaviour, and then work on remedies
such as Remi
Hey Peter,
To my best knowledge there is no universal standard for that but KGS's
convention is probably the most popular for us.
http://www.gokgs.com/help/shorthelp.html?helpLocale=de_DE
- *Japanese* - mostly used (territory and prisoners count)
- *Chinese* - easiest for beginners, bots
It is a great article overall. I would like it more if it mentions Mogo, at
least Follow from the opponent's previous move was actually Mogo's
invention in the famous UCT paper, not Fuego's, not to mention a lot of
Mogo's achievements on 9x9. But I really like the paragraph describing the
great
Hi Martin,
2014-07-03 22:02 GMT+01:00 Martin Mueller mmuel...@ualberta.ca:
We certainly didn’t mean to short-change the MoGo team's or anybody else’s
contribution. For this article there were two main points:
- try to explain as much as possible how things work in a current program
- have
I'm dreaming about this scene in EGC 2015..
Several cameras are relaying the games of the best players. A smart optical
recognition program automatically converts the streaming images to sgfs and
sends them to a Go program. The Go program then shows rich analyses over
the games, such as wining
2014-08-13 10:02 GMT+01:00 Rémi Coulom remi.cou...@free.fr:
There was a bit of irony in Aja’s post, because kifu-snap Crazy Stone
already did this in Sibiu. That’s the reason for the last sentence of his
message (the one you did not quote)
Oh, I actually didn't know your app was already
I'm a member of ICGA. Yesterday I received the copy of December 2013, about
8 months delay. They can be more efficient in sending the paper journals. :)
Aja
2014-08-21 13:31 GMT+01:00 Rémi Coulom remi.cou...@free.fr:
I am not a member of the ICGA either. I think it is really ridiculous to
Congratulations to Remi and Crazy Stone! Crazy Stone is really strong!
Aja
-Original Message-
From: Rémi Coulom
Sent: Sunday, October 05, 2014 11:43 AM
To: computer-go@dvandva.org
Subject: Re: [Computer-go] Interviews on codecentric Challenge
Hi,
As promised, here is the analysis of
Hi,
https://www.gokgs.com/tournEntrants.jsp?sort=sid=933
Congratulations to Aya, the winner of December 2014 KGS bot tournament. I
have some questions.(Sorry, Nick, if you would answer any of them in your
report but I can't wait anyway)
1. Looks like Aya has improved significantly in the last
1 - 100 of 104 matches
Mail list logo
