http://dvandva.org/pipermail/computer-go/
On 12/08/2014 10:40 PM, Hiroshi Yamashita wrote:
By the way, I can not see archives now.
http://computer-go.org/pipermail/computer-go/
___
Computer-go mailing list
Computer-go@dvandva.org
Hi,
I have just noticed:
UEC Cup on March 14-15:
http://jsb.cs.uec.ac.jp/~igo/eng/
Densei-sen on March 17th, with Cho Chikun:
http://entcog.c.ooco.jp/entcog/densei/
http://entcog.c.ooco.jp/entcog/densei/share/data/EC_press_densei.pdf
Rémi
___
Thanks Hiroshi. Most of the paper is available on google books:
http://books.google.fr/books?id=52kqBAAAQBAJpg=PA26#v=onepageqf=false
Rémi
On 22/11/2014 18:53, Hiroshi Yamashita wrote:
Delayed congratulations to AyaMC, winner of last Sunday's KGS bot
Thank you for the tournament and report,
The problem is I was using Windows, and I am not very familiar with that
system. In Linux, the child would have died automatically.
Rémi
On 27/10/2014 10:08, Petr Baudis wrote:
Hi!
On Sun, Oct 26, 2014 at 10:30:10AM +, Nick Wedd wrote:
I wonder how practicable it would be for a bot,
Thanks Ingo. I enjoyed this match very much.
Rémi
On 27/10/2014 11:13, Ingo Althöfer wrote:
Hello,
it seems that currently the mails from this list are not
properly distributed, at least I did not receive the two
mails on zombie processes.
Nevertheless, I found them in the archive. Here are
Hi,
As promised, here is the analysis of the first game by Crazy Stone:
http://remi.coulom.free.fr/CrazyStone/analysis/2014-10-04-fj-CrazyStone/index.html
sgf:
http://files.gokgs.com/games/2014/10/4/fj-CrazyStone.sgf
Thanks FJ, thanks Ingo. I am looking forward to the next game.
Rémi
On
Thanks. It was not a laptop, but a big desktop. i7-5930K, 3.5 GHz, 6
cores, 12 threads. I left the university one month ago, so I don't have
access to the 24-core server any more.
Those 6 cores are really fast. About 3.3 k playouts/s on one core,
compared to about 2k playouts/s on one core of
On 30 août 2014, at 22:10, Dave Dyer dd...@real-me.net wrote:
I've also been comparing blitz play which creates a copy of the
board at top level, and starts each descent with a copy of the board;
compared with unwinding play where every move is explicitly unwound.
Of course, the complexity of
I am not a member of the ICGA either. I think it is really ridiculous to have a
paper-only computer-science journal in 2014.
I’d like to suggest to Detlef to make his paper available online somewhere and
post a link to this list. I am looking forward to reading it.
Rémi
On 21 août 2014, at
I can’t get the TOC there either. And it has not been indexed by DBLP since
2011:
http://www.informatik.uni-trier.de/~ley/db/journals/icga/index.html
IEEE TCIAIG makes a much better impression:
http://www.informatik.uni-trier.de/~ley/db/journals/tciaig/index.html
On 13 août 2014, at 10:35, Petr Baudis pa...@ucw.cz wrote:
Hi!
On Tue, Aug 12, 2014 at 01:15:11PM +0100, Aja Huang wrote:
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
Thanks Petr, Thanks Thomas,
Very interesting report.
I do something similar in kifu-snap. Instead of RANSAC, I use another Hough
Transform to detect the sinusoids in the first Hough Transform. I also use
k-means color clustering for detecting stones, but also combine this with other
features
On 5 juin 2014, at 14:54, Stefan Kaitschick stefan.kaitsch...@hamburg.de
wrote:
such as Remi Couloms simulation balancing
Simulation Balancing is not mine. I did not even implement it ;-)
Rémi___
Computer-go mailing list
Computer-go@dvandva.org
Hi Cameron,
I did not take time to read your paper in details, but I know one go program
based on bitboards:
http://www.quirkster.com/iano/forth/fgp.html
I don’t know if it manages captures differently from you, but you might at
least wish to cite it.
Rémi
On 24 mai 2014, at 11:44, Cameron
I found the code there:
http://comments.gmane.org/gmane.games.devel.go/20854
On 24 mai 2014, at 18:28, René van de Veerdonk rene.vandeveerd...@gmail.com
wrote:
On Sat, May 24, 2014 at 4:34 AM, Erik van der Werf erikvanderw...@gmail.com
wrote:
I think a speed comparison for well optimized
Hi,
Some of you might be interested in this youtube video, with English translation:
https://www.youtube.com/watch?v=gsHK-btcpPM
Thanks to the person who gave the link to me. The reviewed games are Zen vs
Ishida, and Crazy Stone vs Ishida.
Rémi
___
The final results are not available in English, but they are in Japanese:
http://jsb.cs.uec.ac.jp/~igo/result2.html
Rémi
On 7 avr. 2014, at 19:18, Detlef Schmicker d...@physik.de wrote:
Hi,
I can not find an official final result page of this years UEC cup.
Would be great, as I try to
Hi Myriam
All the KGS game records have time stamps. And they are in sgf format (using BL
and WL properties).
http://www.red-bean.com/sgf/properties.html#BL
Rémi
On 14 févr. 2014, at 15:32, Myriam Abramson mabram...@gmail.com wrote:
Does anybody know where I could get game records with the
It seems Zen lost the 4 games:
http://news.mynavi.jp/news/2014/02/11/106/
Rémi
On 3 févr. 2014, at 11:01, Hiroshi Yamashita y...@bd.mbn.or.jp wrote:
Hi,
1st Go Denou-sen will be held February 11th and 16th.
Zen will play against two pros in 9x9 and one top amateur in 13x13,
and Ozawa
Hi Hideki,
Thanks for your comments. Are the game records available?
Rémi
On 11 févr. 2014, at 22:19, Hideki Kato hideki_ka...@ybb.ne.jp wrote:
Professinals can play with no or few mistakes on 9x9 but MC bots play
with more mistakes (perhaps one per 10 to 20 moves?) due to the
randomness.
MM and CLOP are completely different from each other.
MM is for supervised learning of a playing policy from game records. It will
tune parameters (pattern weights) to match a given set of samples moves
(typically from a collection of game records of strong players).
CLOP is black-box
Thanks Nick. In round 18, Crazy Stone lost to Zen, not pachi. Now the seki
errors of CS vs Zen are already fixed ;-)
In the annual table, nomitan gets a “0” but was not in the tournament.
The performance of DolBaram is really impressive, considering that it was
running on 4 cores. If DolBaram
Does Zen evaluate this seki correctly in the playouts?
My impression is that it may have passed because it prefers to keep some false
hope of winning, rather than be certain of a jigo.
Rémi
On 4 févr. 2014, at 22:08, Aja Huang ajahu...@gmail.com wrote:
Thanks Nick for the report. I'm
Thanks Hiroshi.
Nico’s logo is very strange:
http://res.nimg.jp/img/base/head/icon/nico/946.gif
What does it represent?
Rémi
On 3 févr. 2014, at 11:01, Hiroshi Yamashita y...@bd.mbn.or.jp wrote:
Hi,
1st Go Denou-sen will be held February 11th and 16th.
Zen will play against two pros in
Oh, that is the 100th KGS go tournament!
Congratulations Nick, and big thanks for your work in organizing them. I
appreciate them a lot.
Rémi
On 31 janv. 2014, at 00:21, Nick Wedd n...@maproom.co.uk wrote:
The February KGS bot tournament will be held this Sunday,
February 12th, starting at
I believe botnoid was MC.
On 31 janv. 2014, at 11:15, Hiroshi Yamashita y...@bd.mbn.or.jp wrote:
Oh, that is the 100th KGS go tournament!
Awesome!
1st KGS tournament was held in 2005, 10 years ago.
And GNU Go won, there were no Monte Carlo programs.
Hi,
I am considering the possibility to attend the EGC in Sibiu this summer:
http://egc2014.com/
Two weeks is too long for me. I am not familiar with the tournament, but I
suppose it is possible to play just a few rounds of the main tournament. And
I’ll probably try to participate in a short
In Crazy Stone I have a gogui-analyze command that will dump the node of the
tree for the current position. So I can just navigate with gogui and ask for
the statistics of the current node. It is a bit primitive, but I find it usable
enough, and the coding effort is very small.
Guillaume
I am sad to report very bad news about the health of Don Dailey. You can read
the messages of Larry Kaufman there:
http://www.talkchess.com/forum/viewtopic.php?t=50114
Rémi
___
Computer-go mailing list
Computer-go@dvandva.org
100 pts/rank is really very wrong. I don’t have data here, but I remember when
I ran WHR experiments on KGS data, it was very clear that Elo points / rank
increases a lot with rank. At the strength of Crazy Stone (KGS 5d), a rank is
worth much more than 200 Elo points. For beginners, it may be
I found a copy there:
http://bibliographie.jeudego.org/these_sylvain-gelly.pdf
On 11/06/2013 10:51 AM, Ingo Althöfer wrote:
Hello,
is Sylvain Gelly's doctoral dissertation (from 2007) still available
somewhere in electronic form?
Thanks in advance, Ingo.
MCMC has little to do with what we do in computer Go. In MCTS we have a Markov
Chain and we take Monte-Carlo samples from it, but the purpose is really not
the same at all as what MCMC algorithms do. I recommend the wikipedia articles.
It is difficult to really get an idea of MCMC by reading a
On 1 nov. 2013, at 13:32, Darren Cook dar...@dcook.org wrote:
MCMC has little to do with what we do in computer Go. In MCTS we have
a Markov Chain and we take Monte-Carlo samples from it, but the
purpose is really not the same at all as what MCMC algorithms do. I
recommend the wikipedia
Hi Ingo,
It seems mfgo1998 is not playing on KGS any more.
Rémi
On 6 oct. 2013, at 15:44, Ingo Althöfer wrote:
Hello,
my 1,000-Euro prize for a bot that beats the old
Many Faces of Go (version without Monte Carlo components)
at handicap 29 on the 19x19-board ist still open.
When I
godiscussions has been broken for a long time. lifein19x19 is where people
moved to. They have a computer-go section:
http://www.lifein19x19.com/forum/viewforum.php?f=18
There is almost no programmer and no technical discussion there.
On 2 oct. 2013, at 14:04, Ben Ellis wrote:
I'd be surprised
.
That should indicate which player passed more.
Rémi
On 8 sept. 2013, at 10:18, Hideki Kato wrote:
If B played 2 stone in a row, W must played a pass in between.
Hideki
Rémi Coulom: 31259b1d-7305-41b7-b223-fca7da22b...@free.fr:
Hi,
I wonder if it is possible to indicate the number of prisoners
, but feel free
to continue sending them to me.
Have fun, and please let me know if you have any comment or suggestion.
Rémi
On 29 mai 2013, at 16:55, Rémi Coulom wrote:
Hi,
I have just put this on my web page, if some of you are interested:
http://remi.coulom.free.fr/kifu-snap/
Kifu-Snap
Hi,
I have just put this on my web page, if some of you are interested:
http://remi.coulom.free.fr/kifu-snap/
Kifu-Snap is an experimental tool to recognize a go board from a picture. On
this web page you can download a free demo of the current Android prototype.
You might find this prototype
On 29 mai 2013, at 19:38, Gabriel Benmergui wrote:
Nice work Remi. Would gladly put up a link on kaya for it. Im assuming it
makes it into sgf?
Yes, it produces an sgf file. Thanks for the link offer. The app. is currently
very experimental, and maybe not ready for prime time, so I don't
I tried to send a polite request to Rudy Lolo but he did not answer.
Rémi
___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
That is difficult. Usually the central win rate is optimistic, and the win
rate over all games is pessimistic. So those numbers should give you an idea of
the range of the win rate you can expect with current estimated optimal
parameters.
But it might be possible to have narrower estimates.
Hi,
If you wish to explore the behaviour of CLOP on a particular problem, I
recommend the test_swig.py script in the programs/clop/script/artificial
directory.
You have to edit this script to select the experiment you wish to run.
First, select your problem. You can do this by uncommenting
If I understand your notation correctly, CLOP can get C = 1/3 for smooth
functions.
In theory, regression with a polynomial of degree d gets C = 0.5 * d / (d + 1)
if the function is as smooth as the polynomial with bounded (d+1)th derivative.
There is an experiment in the CLOP paper that
On 7 févr. 2013, at 21:01, Olivier Teytaud wrote:
(the constant term in the linear slope in log-log term depends on the
number of parameters,
this might be relevant for Brian's remark on the number of parameters).
I am not sure it does. In fact I would guess it does not. If the
On 01/07/2013 03:02 PM, Vlad Dumitrescu wrote:
Hi!
On Mon, Jan 7, 2013 at 2:51 PM, Don Dailey dailey@gmail.com
mailto:dailey@gmail.com wrote:
2013/1/7 Don Dailey dailey@gmail.com
mailto:dailey@gmail.com
I have a question concerning a related
http://www.grappa.univ-lille3.fr/icga/event.php?id=44
Rémi
___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
You can use gogui.
On 23 nov. 2012, at 14:28, Aja Huang wrote:
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
On 8 nov. 2012, at 14:09, Don Dailey wrote:
I thought KGS had their own proprietary protocol?
Yes. And I don't think GTP can be of any help to connect a web client to KGS.
See that page:
http://senseis.xmp.net/?KGSueMe%2FDiscussion
Note that wms himself is developing a web client:
On 2 oct. 2012, at 09:18, Jirong wrote:
Dear all,
We are happy to announce TAAI 2012 Computer Go Tournaments.
The top bot can play with pro go players.
If you are interested, please register at http://www.tcga.tw/taai2012/eng/
On 2 oct. 2012, at 11:30, Aja Huang wrote:
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
A link to the file might be more convenient for many:
http://files.gokgs.com/games/2012/8/14/Blubbel-AyaBot4-2.sgf
Rémi
___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
the Mean column on the Max tab? How does
one get them out? Copy to clipboard only works for a single cell at a
time. I'm on Windows.
On Thu, Sep 1, 2011 at 3:01 AM, Rémi Coulom remi.cou...@free.fr wrote:
Hi,
This is a draft of the paper I will submit to ACG13.
Title: CLOP: Confident
:34, Rémi Coulom wrote:
If you can edit the source code and re-compile, you can try replacing:
Qt::ItemIsEnabled
by
Qt::ItemIsEnabled | Qt::ItemIsSelectable
in MainWindow.cpp
I don't have time to test or prepare a new version, sorry.
Rémi
On 8 juil. 2012, at 08:52, Michael Williams
Do you mean you have N real cores (so 2N hyperthreads), and run your program
with N threads?
You might be able to disable hyperthreading in the BIOS to solve this problem.
I imagine that if you use 2N threads in your program, it should almost stop the
clop experiment.
Rémi
On 29 mai 2012, at
On 21 mai 2012, at 08:17, Chin-Chang Yang wrote:
Hi,
I want to know more information about English version of CrazyStone 2012. Can
anyone answer the following questions?
Does it support Chinese rule?
Yes.
What does the Histogram mean?
It is the distribution of playout scores.
In
On 21 mai 2012, at 09:36, Rémi Coulom wrote:
You can choose a level. The web site says 10 levels of play. The most
recent beta I tested actually had 20, so it may be 20 after all. Each level
corresponds to a total number of playouts per game.
There are in fact 10 levels as indicated
Now with the correct e-mail address.
On 17 mai 2012, at 16:43, Rémi Coulom wrote:
I took a closer look at the games.
19 is hanezeki:
http://senseis.xmp.net/?Hanezeki
I don't worry too much about that. Did this ever occur in a real game?
I would recommend using non-integer komi for your
I suppose he means an empty intersection.
The rule used usually is: all 4 immediate neighbours are of my color and the
opponent has no more than two (one on the side) stone(s) in diagonal.
That rule will improve the strength of stop-cur considerably.
Rémi
On 10 mai 2012, at 18:55, Álvaro
After a few days of running my program on CGOS, the 9x9 client crashed with the
error message below. lsof shows that tclsh has a lot of open files. Maybe
there is something that needs to be closed somewhere. Anybody got the same
problem? Maybe that only happens when there are many players and
I reserved a small 4-core node of our cluster to connect 9 fast instances of
Crazy Stone, 3 for each board size.
On 23 avr. 2012, at 19:48, ds wrote:
Hi,
would be nice, if one could arrange a typical date, where one can hope
to find more programs on cgos.
E.g. once a week or once every
Rémi Coulom:
I reserved a small 4-core node of our cluster to connect 9 fast instances of
Crazy Stone, 3 for each board size.
On 23 avr. 2012, at 19:48, ds wrote:
Hi,
would be nice, if one could arrange a typical date, where one can hope
to find more programs on cgos.
E.g. once a week
2012/4/24 ds d...@physik.de
Thanks a lot,
there is a long way to go for us with this impressible strength:)
Detlef
Am Dienstag, den 24.04.2012, 19:43 +0200 schrieb Rémi Coulom:
In Crazy Stone, I set the total number of playouts per game, not per move.
250k per game is similar
Hi,
I have just noticed that the citeulike collection of bibliographic references
has not been updated in a while:
http://www.citeulike.org/group/5884/library
I'd like to invite authors of papers related to computer go to post them there.
That will improve their visibility.
Rémi
On 8 avr. 2012, at 22:13, Ingo Althöfer wrote:
This product uses the newest version and, in addition, has analysis
window feature, which is very useful for anaylizing and research of
games.
We need it in Western version, too.
I am sorry this won't be in the western version. You can
Hi Ingo,
I don't know the exact date, but the English version will be available soon.
The old version is available at a discount until then. The new version will be
available from that page:
http://www.unbalance.co.jp/igo/eng/
It currently says in the middle of April.
Rémi
On 8 avr. 2012, at
Thanks Nick. Crazy Stone's analysis of the victory of Zen against Pachi is
still online:
http://www.grappa.univ-lille3.fr/~coulom/CrazyStone/2012-03-14-Pachi/index.html
Rémi
On 22 mars 2012, at 12:41, Nick Wedd wrote:
Congratulations to pachi2, winner of the Slow KGS bot tournament!
My
Accelerated UCT does this:
https://www.conftool.net/acg13/index.php/Hashimoto-Accelerated_UCT_and_Its_Application_to_Two-Player_Games-111.pdf?page=downloadPaperfilename=Hashimoto-Accelerated_UCT_and_Its_Application_to_Two-Player_Games-111.pdfform_id=111form_version=final
Rémi
On 6 mars 2012, at
Hi Xaryl,
You don't have to apologize. You caused no trouble. Welcome to the list.
Rémi
On 14 févr. 2012, at 17:11, Xaryl C wrote:
First of all, sorry for creating a new thread.
I wasn't on the mailing list, and wasn't sure how to respond to a thread
without the original mail.
Also sorry
Hi,
I'd like to get a copy of the game records of Crazy Stone on CGOS, and I cannot
find a convenient way to do it. The archives do not seem up to date. Any
suggestion? I'd be happy if I could at least get the archive of the January
games.
Thanks,
Rémi
.
Original-Nachricht
Datum: Mon, 16 Jan 2012 09:33:32 +0100
Von: Rémi Coulom remi.cou...@free.fr
An: computer-go@dvandva.org
Betreff: [Computer-go] minirock2
Anybody knows what is minirock2? Was it programmed by rock2? That would
be
big news :-)
Fabien, are you reading
In the most recents Crazy Analysis, Delta is the difference between the
evaluation of this move, and the evaluation of the next position of the game.
For instance, in this page:
http://www.grappa.univ-lille3.fr/~coulom/CrazyStone/ingo/index.html
At move 72, delta = 0.0431076 is 0.441597 (value
The problem is that kgs saves handicap stones as black moves (B), instead of
setup stones (AB), when playing with Chinese rules. The sgf specification says
that they should be setup stones. Gogui correctly sends a set_free_handicap
command to your engine if setup stones are indicated instead of
On 19 janv. 2012, at 20:49, Richard J. Lorentz wrote:
After reading all these posts I have concerns about this whole game within a
game idea. It's beginning to look like the pro's behavior becomes part of
the experiment, which you probably don't want as it would be demeaning to the
pro. I
of my laptop.
Congrats to Zen, btw.
Rémi
On 16 janv. 2012, at 11:34, Isaac Deutsch wrote:
For people who missed it in the Kibitz, Rémi Coulom also put together a very
nice automatic analysis tool for this game:
http://www.grappa.univ-lille3.fr/~coulom/CrazyStone/CrazyAnalysis.html
As he
On 17 janv. 2012, at 11:05, Ingo Althöfer wrote:
Hello Remi,
thanks a lot for your nice service.
Hopefully, this feature will flow also in forthcoming
commercial versions of CrazyStone.
Hi Ingo,
Since many people seem so interested, we may try to include it in the next
version.
A
Anybody knows what is minirock2? Was it programmed by rock2? That would be big
news :-)
Fabien, are you reading?
Rémi
___
Computer-go mailing list
Computer-go@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
I have this problem too. I think the problem is not resignation. The problem is
when several player challenge at the same time. You can tell kgsgtp to write a
log. Below is such a log for CrazyStone.
So it must be a bug in kgsgtp. Maybe wms reads this. Otherwise, we could send a
message to
Thanks Jouni for buying Crazy Stone. And yes, Don, there is an Android version.
All the many versions of Crazy Stone are listed on its web page:
http://remi.coulom.free.fr/CrazyStone/
Chinese versions coming soon.
Rémi
On 10 janv. 2012, at 23:48, Don Dailey wrote:
Is there an Android version
Hi Vlad,
Sorry for your medal. I don't do the UI stuff, but I'll forward your remark to
Unbalance. Or if you can send the position with the wrong scoring to me, I'll
try to make CS score it correctly.
Rémi
On 11 janv. 2012, at 15:24, Vlad Dumitrescu wrote:
Hi,
On Wed, Jan 11, 2012 at
I wonder what kind of abuse you censor. I never observed any behaviour I'd
like to censor with Crazy Stone.
Rémi
On 10 janv. 2012, at 21:19, Jean-loup Gailly wrote:
I know the Zen author occasionally logs in as the bot and censors people
who abuse the bot.
I do this too for pachi2.
On 7 janv. 2012, at 21:07, Jouni Valkonen wrote:
6d for MC-gobot seems a bit optimistic, I would bet €5 that it won't happen
in 2012. 6d's are ridiculously strong. I calculated that in January, out of
56 games against 5d's CS won 48%. This is indeed impressive, although there
is long way
On 8 janv. 2012, at 16:25, Thomas Wolf wrote:
Reaching 6 Dan may well happen, I only want to say that the difference between
5.99 dan and a stable 6.00 dan can be big because then all players get one
more
stone, all games are somewhat different.
This all depends on the rating system.
You can have a bounded integer parameter. For instance:
IntegerParameter my_parameter 0 1
CLOP may not be the most efficient approach to tuning boolean parameters,
because it makes little sense to do quadratic regression over boolean
parameters. But it should work.
Rémi
On 4 janv. 2012, at
you can optimize over discrete parameters, continuous parameters,
etc., by describing them, generating the experiments, and iterating.
it's not simply an optimization tool, so requires more hands-on work,
but it's quite good.
s.
On Wed, Jan 4, 2012 at 2:42 AM, Rémi Coulom remi.cou
On 4 janv. 2012, at 16:22, Olivier Teytaud wrote:
BTW, I imagine that CLOP could be any fully automated parameter tuning
solution. That is, nothing here is really specific to CLOP. It just happens
that CLOP is the first fully automated parameter tuning system that I have
made to work.
As a human player, I would be opposed to playing against a program in a
tournament. So I don't wish to participate in human tournaments with Crazy
Stone.
Also, having to operate the program manually would be a huge pain. Playing
casual games automatically on KGS is much more pleasant for me,
On 2 janv. 2012, at 20:12, David Fotland wrote:
Very impressive. Does anyone know the relative hardware? I think the 5 dan
Zen was running on 26 cores.
Thanks for the nice comments. I am running on 24 cores (Dell PowerEdge R905
Rack Server, 4 x Six-Core AMD Opteron(tm) Processor 8439 SE,
Hi,
A video with the results of the first day is online there:
http://www.ustream.tv/channel/uec-go-2011
If I understood correctly, the top players may be:
1. Zen
2. Erica
3. Aya
4. Pachi
5. Many Faces
6. Nomitan
But my japanese is not so good :-)
Rémi
There will be a live video broadcast of the ACG13 conference:
http://www.grappa.univ-lille3.fr/icga/news_item.php?id=71
This a link to the programme:
https://www.conftool.net/acg13/sessions.php
Rémi
___
Computer-go mailing list
My implementation is very basic (and inefficient). I use Gibbs sampling (ie,
Metropolis-Hastings, one dimension at a time, which scales better to higher
dimensions), with uniform samples over the parameter range. Details of the
implementation are in CSPWeight.cpp. I found it is good enough in
I have no idea. I did not really spend any time trying to prove mathematically
that CLOP works. Another source of ideas might be that paper about a similar
method, where they propose a proof of convergence:
http://www.informs-sim.org/wsc07papers/041.pdf
But the algorithm is extremely
The prior strength was increased from 1e-3 to 1e-2, and the number of
iterations of the localization process was limited to 7.
I did not have time to measure this very precisely, but tests on Rosenbrock5
show a performance improvement. I made that change because some users of CLOP
sent data to
On 7 nov. 2011, at 14:07, Brian Sheppard wrote:
I have also seen runs where many localization iterations are necessary, but
I did not connect that to overfitting.
I do see Clop runs that wander for an excessive number of trials. That has
troubled me, because I would like to use Clop for
Hi,
I have just uploaded a new version of CLOP.
Changes:
2011-11-05: 0.0.9
- Stronger regularization (avoid overfitting in high dimensions)
- Merge Replications option in gui - faster, better display
- Performance optimization of display and loading of large data files
- Removed -ansi
I think it is more like 100k on 9x9, and 25k on 19x19
http://www.mail-archive.com/computer-go@computer-go.org/msg11214.html
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,
Hi Brian,
On 4 oct. 2011, at 18:54, Brian Sheppard wrote:
Hi, Remi. I have a question about the burn-in process for CLOP.
Normally you need a lot of data to make a decent regression function. For
example, if you have N arguments in your function, then CLOP
(Correlated-All) needs 1 + N *
tournament is 25 Euros
instead of 40.
Rémi
On 27 sept. 2011, at 18:37, Petr Baudis wrote:
Hi!
On Thu, Sep 22, 2011 at 07:28:57PM +0200, Rémi Coulom wrote:
I have just posted this on the web site of the Olympiad:
Schedule for Go tournaments:
• 21-22 nov go 9x9
• 23 nov go 13x13
On 24 sept. 2011, at 17:06, Erik van der Werf wrote:
BTW Are you planning to participate with Crazystone?
I will attend the conference, and present the CLOP paper there, but I don't
plan to participate in tournaments.
Rémi
___
Computer-go mailing
On 23 sept. 2011, at 02:53, Hideki Kato wrote:
Rémi Coulom: de4c2e5c-94d2-4ef0-9186-8738a6690...@free.fr:
Hi,
I have just posted this on the web site of the Olympiad:
Schedule for Go tournaments:
• 21-22 nov go 9x9
• 23 nov go 13x13
Thank you Rémi, but 13x13 Go
Hi,
I have just posted this on the web site of the Olympiad:
Schedule for Go tournaments:
• 21-22 nov go 9x9
• 23 nov go 13x13
• 24-25 nov go 19 x 19
• 26 nov. 19x19 play-off if any, or a demonstration game
Participants have to register separately for each
1 - 100 of 150 matches
Mail list logo
