Re: Results of the 2nd UEC Cup (Re: [computer-go] UEC cup)

2008-12-18 Thread Shunsuke SOEDA
Thank you for your suggestion David.

On Thu, Dec 18, 2008 at 12:48 PM, David Fotland fotl...@smart-games.com wrote:
 One option is to reduce the time limit from 40 minutes to 30 minutes to add
 another round.  You can seed a swiss competition so it is likely that the
 best programs will meet in the last round.
Well, we have thought of making the games shorter, but we were concerned of
the effect it might give to the results of the tournament.
#I understand that shorter games will work against MC based programs.

If 40 minutes is too long for most programs, we would certainly like to move to
shorter games.

Regards,
 Shunsuke Soeda
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


Re: [computer-go] Format of the UEC Cup

2008-12-18 Thread Shunsuke SOEDA
Thank you for you suggestions, Rémi.

To tell the truth, I was also surprised by the format of the tournament
when I first heard it last year, and still in doubt if it is a good way to
organize the tournament.
#Especially when the top four programs get seeded next year.

I did not come up with the idea of having no seeds, it is certainly
worth discussing.
Organizing a 'minor league' is difficult due to the number of
participants and the
availability of space, but we might be able to organize one if we are able to
afford more rooms.

On Thu, Dec 18, 2008 at 6:16 PM, Rémi Coulom remi.cou...@univ-lille3.fr wrote:
 Shunsuke SOEDA wrote:

 Another reason we chose the single elimination tournament, is that
 the finals in the single elimination is the finals, while in other
 matching
 systems, the final game might become a dull game.

 We know that we are sacrificing accuracy, and do want to know
 what the participants (and might-be-participants) think about how the
 tournament should be organized.
 #This includes opinions on how should remote attendance be allowed


 At first, I was also surprised by the format of the tournament. From a
 statistical point of view, it certainly does not rank participants in the
 most accurate possible order. But the ranking of a 9-round tournament always
 depends a lot on luck, anyways. The advantage of direct elimination is that
 there is no risk of tie, and it makes the final rounds more exciting. I
 think the format is very good.

 Still, I have a couple suggestions.

 First, it might be better to let everybody play in the qualification
 tournament, even the previous top 4. The quality of pairings in the second
 day depends a lot on the quality of ranking of the qualification tournament.
 Strong programs would have no difficulty to qualify, anyways. And a program
 that loses a game because of technical problems can try to fix the technical
 problem for the next game (or the next day).

 Also, some participants may feel frustrated that they were eliminated in the
 first day. Maybe they could play swiss between them in the second day.

 Regarding remote play, I don't like it, but that is probably because I don't
 profit from it, whereas my strongest opponents do :-)

 It seems that the UEC Cup is very well organized, and I thank you very much
 for your work.

 Rémi
 ___
 computer-go mailing list
 computer-go@computer-go.org
 http://www.computer-go.org/mailman/listinfo/computer-go/

--
 Shunsuke SOEDA
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


[computer-go] The first Go UEC cup

2007-10-03 Thread Shunsuke SOEDA
Dear all,

As most of you know, Gifu Challenge was canceled for this year.
Instead, there will be a computer go competition held
by the Cognitive Science and Entertainment (EC) Research Station of
the University of Electro-communications.

Unfortunately, we are not able to provide prize money for this competition.

As with Gifu Challenge, some number of deputy operators
will be available, so you can attend the competition even if you
cannot come to Tokyo. As we might not be able to provide
operators as much as the Gifu Challenge, please contact us early
if you require a deputy operator.

The announcement follows:

Cognitive Science and Entertainment (EC) Research Station of
the University of Electro-communications,  are organizing the first
Computer Go UEC Cup during December 1-2, 2007 at the east campus
of the University of Electro-Communications, Tokyo.
Computer Go Forum is the co-organizer.

This competition, being planned as a successor of Gifu Challenge,
is open to anyone in any country. The aim of the competition is, by
serving  as a place of technical exchange of international computer
Go research, to activate research of computer Go.
With this purpose, the winning prize is not money, but a trophy.

Important Dates:
 Entry submission deadline: October 31, 2007
 Championship: December 1-2, 2007

The website of the UEC Cup is as follows:
http://jsb.cs.uec.ac.jp/~igo/eng/

You can register from the form provided on the website:
http://jsb.cs.uec.ac.jp/~igo/eng/mailform.html

If you have any questions, feel free to contact us from
[EMAIL PROTECTED]

___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


Re: [computer-go] .. if Monte-Carlo programs would play infinitestrong

2006-11-24 Thread Shunsuke SOEDA

 Eeh, am I missing some point here or would not any Go program that uses
 search and infinite computer power simply SOLVE the game - given that
 scoring is done right and infinite loops are ruled out?

The question should be more precisley stated as: Is playing strength a
strictly-monoton increasing and unlimited function of computing power. But I
thought the meaning of the question was clear.


Considering simple Monte Carlo approach to 9x9 Go, the answer to this
question is, No.

Experiments made by Yoshimoto showed that dimishing returns could be seen
when adding samples. It is described in the following article:
Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro
Kishimoto, and Kenjiro Taura: Monte Carlo Go Has a Way to Go,
Twenty-First National Conference on Artificial Intelligence (AAAI-06),
pages 1070-1075, 2006

The paper could be found at the following location:
http://www.fun.ac.jp/~kishi/publication.html
--
Shunsuke SOEDA
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/