[EMAIL PROTECTED] wrote:
Hello all,
I am wondering about Go in 7x7. I know that the game in this size has no real
interest in itself. However, I think that the level of computer go programs
is much higher in 7x7 than in 9x9, and it could be interesting to see until
where we can go in 7x7.
Don Dailey wrote:
I reported earlier that Lazarus wins as white with 8.5 komi. Out of 256
games the win percentage was 53.9 percent.
I tripled the level and ran off 179 games. Now BLACK wins by 54.2
percent. 179 is not enough games, but it appears to be a turnaround.
Of course black SHOULD
Peter Drake wrote:
I've decided to bite the bullet and implement UCT in Orego, since (a)
everyone else appears to be using it and (b) not being a statistician,
improving on this is probably not where I'm likely to make a
contribution.
Here's my understanding of UCT. It is an algorithm for cho
Peter Drake wrote:
On Nov 3, 2006, at 8:10 AM, Rémi Coulom wrote:
You can try multiplying uncertainty by a well-chosen constant value.
This way, you can tune how selective your search is. I found that
using a constant < 1 improves the search on 9x9 for Crazy Stone (I
use 1/sqrt(10), i
Hi,
I am in search of Go positions that are easy to understand for humans,
and difficult for computers.
I will have to give a talk soon about computer Go to an audience of
computer-science researchers who do not know the game. My objective is
to try to make them understand why writing a Go-p
steve uurtamo wrote:
i think that these won't be terribly easy
for your audience to parse. part of the
problem is that gnugo is actually better than a
beginner, for instance.
A beginner cannot beat GNU Go, but it should be easy to make up
positions where a beginner can find the right move an
John Tromp wrote:
On 11/23/06, *Rémi Coulom* <[EMAIL PROTECTED]
<mailto:[EMAIL PROTECTED]>> wrote:
I have come up with a simple position where GNU Go fails: it is a
position with two ladders. The best move is a double-purpose ladder
breaker at the intersection of the
David Fotland wrote:
Many Faces plays L10, which looks like it also breaks both ladders.
-David
Thanks for testing.
What if Black replies with K9 ? It looks like K9 restores both ladders
(to my naive eye).
What about the first position I posted, where more tempting moves are
available elsew
Sanghyeon Seo wrote:
Recently Remi Coulom asked for Go positions that are easy to
understand for humans, and difficult for computers.
I missed the thread at the time, so here's my late two cents.
GNU Go passes as black. White plays C1. Now A1 and E1 are miai. White
wins 1 point. (There are same
alain Baeckeroot wrote:
Le mercredi 22 novembre 2006 20:44, Rémi Coulom a écrit :
Hi,
Hi Rémi
I am in search of Go positions that are easy to understand for humans,
and difficult for computers.
One incredibly simple example for human, where GNU Go horribly fails.
The only
Chrilly wrote:
I believe that MC will be the only way to write a GO program in the
near future leaving the other stuff in the dust (like Mogo has with 9x9
Monte Carlo Go.)This happened in computer chess several times,
someone came up with some breakthrough idea, proved it with actual
resul
Don Dailey wrote:
Hi Steve,
What you fail to take into considerations is that a monte/carlo
player may ruin it's chances before the weaker player has a
chance to play a bad move. The monte carlo player sees all
moves as losing and will play almost randomly.
I don't agree. Here is the winning
Don Dailey wrote:
I'll take a final poll - speak now or forever hold your peace!
Should we:
1. Give white N-1 stones at end of game. (where N = handicap)
2. Give white N stones at end of game. (N = handicap)
3. Give white N stones except handicap 1 case.
4. Not worry about giving
Hi Jonas,
welcome to the list.
The idea of using f(score) instead of sign(score) is interesting. Long
ago, I tried tanh(K*score) on 9x9 (that was before the 2006 Olympiad, so
it may be worth trying again), and I found that the higher K, the
stronger the program. Still, I believe that other f
Hi,
I have got a lockless hash table to work, and I thought I'd share the
results.
A lockless hash table is very important, because the usual approach that
consists in using a global lock during tree search and update does not
scale well, especially on 9x9. But it is possible to create a com
Don Dailey wrote:
These are used in parallel chess programs, and it's very common. A
pretty good article on this written by Hyatt (Crafty programmer and
author of former world computer chess champion Cray Blitz) and it's
called "A lock-less transposition table implementation for parallel
searc
Olivier Teytaud wrote:
Hi,
I have got a lockless hash table to work, and I thought I'd share the
results.
[...]
Great! For networks of 4-cores, it is not very useful,
but for highly smp machines it could be great - with your
grid5000 account, you might run crazystone on a
16-core machine and
Hi,
This is my CG2008 paper, for statisticians:
Whole-History Rating: A Bayesian Rating System for Players of
Time-Varying Strength
Abstract: Whole-History Rating (WHR) is a new method to estimate the
time-varying strengths of players involved in paired comparisons. Like
many variations of the
Andy wrote:
Remi, you mentioned how the other algorithms predicted well and
guessed that it's because the great majority of games are between
experienced players whose strength is not changing much. I also feel
that the existing KGS ratings work well for those players already. So
how about f
Don Dailey wrote:
Hi Rémi,
For a while I have considered overhauling the rating system for CGOS.
My system is ad-hoc and based on gradually increasing K factor based on
your opponents K in the standard ELO formula.
I don't know if your idea here is feasible for a computer server,
because
Hi,
I thought I should let you know that I have accepted to serve as
programmers representative on the board of the ICGA. That position had
been vacant for a while, and the ICGA offered me to be an interim
representative until the election of the new board (which will take
place in Beijing).
Jason House wrote:
On May 19, 2008, at 10:09 AM, Rémi Coulom <[EMAIL PROTECTED]>
wrote:
Hi,
I thought I should let you know that I have accepted to serve as
programmers representative on the board of the ICGA. That position
had been vacant for a while, and the ICGA offered me to
Carter Cheng wrote:
Hi,
I have been leafing through a book "Reinforcement Learning" by Sutton and Barto. The book seems to serve as a decent introductory text to some of the issues which are mentioned in parts of Sylvain Gelly's thesis.
The book however, is a decade old and I curious if there
Dear Go programmers,
I remind you that the deadline for early registration to the ICGA
Computer Olympiad is June 15. After that date, registration fees will be
doubled. You'll find all information on the web site of the tournament:
http://www.grappa.univ-lille3.fr/icga/event.php?id=37
I hope
David Fotland wrote:
Thanks! I just registered. Who else is going?
David
Great that you registered. The list of registered participants will be
published on the web site after the deadline for early registration
(June 15). I expect it will be an exceptional tournament. According to a
pap
John Fan wrote:
What is the protocol? GTP?
Usually, games are played with whichever protocol both programs support.
In 2006 and 2007, some games were played with gogui-twogtp, some were
played on KGS, and some were played by hand.
Note that the Go rules of the Computer Olympiad for superko
John Fan wrote:
For uct/mc bots rely on the time_left command to dynamically adjust
the number of simulations, seems kgs would the preferred protocol. I
do not know well enough whether gogui-twogtp tracks time or not. But I
guess it does not. Obviously playing by hand is hard to tell the bot
h
Carter Cheng wrote:
I am actually relatively nearby (Hong Kong) and would like to attend but I may not have a competitive program at this time. Is it possible to attend without a program and machine?
Regards,
Carter.
Usually, access to the tournament is free for the audience. I am not
sure
Hi,
I just saw this:
http://www.usgo.org/resources/downloads/berlekamp.wmv
I thought some of you could be interested. References are there:
http://math.berkeley.edu/~berlek/cgt/go.html
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http:
allowed. However, we don't have confirmation regarding the internet access.
The Chinese are busy with it.
Best regards,
Mark Winands
-Original Message-
From: Rémi Coulom [mailto:[EMAIL PROTECTED]
Sent: Monday, June 09, 2008 10:36 AM
To: Winands M (MICC)
Subject: [Fwd: Re: [comput
Carter Cheng wrote:
Thanks Remi. Are standard accommodations being provided by the site organizers
or will we have to for the most part make our own arrangements? I guess I have
a few more days to decide whether or not to submit a basic program which most
likely will not win any games given ho
Rémi Coulom wrote:
David Fotland wrote:
Thanks! I just registered. Who else is going?
David
Great that you registered. The list of registered participants will be
published on the web site after the deadline for early registration
(June 15). I expect it will be an exceptional tournament
Erik van der Werf wrote:
On 6/23/08, Rémi Coulom <[EMAIL PROTECTED]> wrote:
a schedule was posted too:
http://www.grappa.univ-lille3.fr/icga/event_info.php?id=22
Not much details yet in this schedule...
I'm interested to participate, but I'd like to know some more
Peter Drake wrote:
Can anyone point me to a thread, or at least some buzzwords?
I'm having little luck googling for words like "recent" and "forget".
Thanks,
Peter Drake
http://www.lclark.edu/~drake/
Try "discounted UCB":
http://computer-go.org/pipermail/computer-go/2007-March/009033.html
h
Hi,
KCC just registered to the 19x19 tournament of the Computer Olympiad:
http://www.grappa.univ-lille3.fr/icga/tournament.php?id=181
I remember reading about some plagiarism allegations, for instance there:
http://www.msoworld.com/mindzine/news/scandals/scandal0400.html
http://web.archive.org/w
Hi,
This was just announced on the ICGA Tournaments web site:
http://go.nutn.edu.tw/eng/main_eng.htm
It is right before the Computer Olympiad, and registration is free for
participants in the Olympiad.
Rémi
___
computer-go mailing list
computer-go@c
Erik van der Werf wrote:
That's a pretty good deal!!!
http://64.68.157.89/forum/viewtopic.php?topic_view=threads&p=193819&t=21591
Why isn't there any sponsoring like this for the other tournaments?
Erik
I considered entering with my chess program for this reason. But since
the tournaments a
[EMAIL PROTECTED] wrote:
http://www.computer-go.info/egc2008/
Hi,
I see myself listed as possible participant on that page, so I would
like to say that I will not participate, sorry. I won't travel to
Sweden, and if I am not going to be there in person, then I prefer to
participate in KGS
Hi,
I believe they did not announce it to the list, so in case you don't
know, you can find the source code of Fuego there:
http://fuego.sourceforge.net/
It seems to be performing very well on CGOS.
Rémi
___
computer-go mailing list
computer-go@compu
Hi,
I recently found those papers. The unimaas website seems to be down
right now, but I expect it will be back online soon.
THE PARALLELIZATION OF MONTE-CARLO PLANNING:
http://hal.archives-ouvertes.fr/docs/00/28/78/67/PDF/icin08.pdf
Parameter Tuning by the Cross-Entropy Method:
http://www.cs
Markus Enzenberger wrote:
Rémi Coulom wrote:
I could not find the link for suggesting updates to the computer go
bibliography, so if the people from the University of Alberta read
this, they might like to add those papers to their bibliography.
I probably won't continue maintainin
Urban Hafner wrote:
Rémi Coulom wrote:
| If nobody at UofA wants to continue, then I can do it.
How about using citeulike.org? Someone could create a group for
computer-go and people could add new papers. That way it wouldn't be the
responsibility of just one person to keep the list
Markus Enzenberger wrote:
Rémi Coulom wrote:
This seems to be a good solution. I have just applied to your
computer-go group. We just have to try to import the bibtex file.
Markus, can you do it ? Or tell us where to download the bibtex file ?
I added a link to the bib-file on the website
Martin Mueller wrote:
This is a message for whoever is running gnugo3.7.10_10bis on 19x19 CGOS.
This program does not seem to finish the games under CGOS rules
correctly. I believe you need to set options such as
--mode gtp --chinese-rules --capture-all-dead
For example, look at game 37209.sg
Nick Wedd wrote:
CrazyStonepossible possible
This is "yes" from my point of view. It all depends on the availability
of an operator.
What is the komi for the 9x9 tournament ? I would prefer 7.5 because it
is also the komi of the Computer Olympiad.
Thanks,
Rémi
___
Don Dailey wrote:
I also feel for the Mac people and also people that have built
programs that run on networks of workstations or other potential
supercomputer programs that would not be able to participate.
- Don
Although I am one of the participants with access to non-conventional
comput
David Doshay wrote:
Someday computer Go will evolve enough to have enough trust for
remote computing. But not today, unfortunately.
Cheers,
David
The Computer Olympiad has allowed it, at least in 2006, 2007, and 2008.
Rémi
___
computer-go mailing l
David Doshay wrote:
Had I known that I might have participated. I thought I would have
to ship my cluster, and with my previous traveling cluster I thought
it would never get past the US airport security ... is was such a mass
of wires and parts that it hardly even looked like a computer.
Cheers
Don Dailey wrote:
But all of this presents another issue - most of us don't like to be
forced to work in another environment. It really is far more logical
to accommodate the programmers when it is not so difficult to do so
and especially when it requires much less total effort than making
Hi,
A schedule for the 9x9 and 19x19 tournaments at the Computer Olympiad
has been posted:
http://www.grappa.univ-lille3.fr/icga/event_info.php?id=22
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/lis
Rybka 3 has Monte-Carlo evaluation:
http://www.chessbase.com/newsdetail.asp?newsid=4772
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Don Dailey wrote:
I hate to keep calling this MC-UCT because many programs do not use
UCT so until we come up with better terminology I'm going to call it
MC-BFS for Monte Carlo with Best First Search.
I think "Monte Carlo Tree Search" is a good name. The University of
Maastricht peop
Nick Wedd wrote:
In message <[EMAIL PROTECTED]>, Jason
House <[EMAIL PROTECTED]> writes
Option C sounds best to me too.
(C.) Hold it on August 17th.
Unless people here persuade me otherwise, I tend to prefer (C).
Nick
Ok, C is carried unanimously. August 17 it will be.
Another problem
Nick Wedd wrote:
My impression is that in Japan, there are conferences like that.
Nick
Your message reminds me that I had not told the list yet about those
reports I wrote for the ICGA Journal:
http://remi.coulom.free.fr/reports/ICGAJ-GPW.pdf
http://remi.coulom.free.fr/reports/ICGAJ-UECCup.
Hideki Kato wrote:
Mark Boon: <[EMAIL PROTECTED]>:
Opposed to removing 9x9.
In favor of adding 13x13 wthout removing 9x9.
Me too. If, however, limited two 9x9 and 13x13 might be better now as
19x19 is not so utilized, IMHO. It's just early this year many
programs started being run
Denis fidaali wrote:
Hi there.
To my best knowledge, most people do use Gogui and gtp. This provides
interesting ways to see analysis results. But only in a "flat" way.
You'll find a tool for visualizing MC trees in gogui, on Guillaume's page:
http://www.cs.unimaas.nl/g.chaslot/
Rémi
___
Thomas Lavergne wrote:
15:02:10E->C =c5
15:02:10Apparently, engine crashed
But there is no sign of crash in my engine, all goes like if the cgos
client have interrupt my engine.
Maybe you should send "= c5" (with a space) instead of "=c5".
Rémi
Well done, Mogo team !
terry mcintyre wrote:
moves,” like those in the lower right-hand corner, where Moyogo took
Typo :-)
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Gian-Carlo Pascutto wrote:
Hi all,
there doesn't seem to be any news from the European Go Congress.
Nevertheless, I see that partial results were posted:
19 x 19
Results
1stCrazy Stone6/6
2nd Leela 5/6
3rdMany Faces of Go 4/6
9 x 9
Results
1stLee
Nick Wedd wrote:
Looking at LeelaBot's games on KGS since the tournament, I see only
two: the one I posted, against sestir, and one against egc1p with 0.5
komi, which I cannot open, as it was not finished by the players and
KGS is treating it as escaped.
Nick
The link I sent yesterday wor
Gian-Carlo Pascutto wrote:
In message <[EMAIL PROTECTED]>,
This was foolish of me because I had resumed the game, and was allowing
LeelaBot's time to pass. I have carelessly destroyed the evidence of
LeelaBot's remaining time. There is now only my word (and perhaps the
operator's) fo
Basti Weidemyr wrote:
What would you have done in a case like this? :)
You could not declare that game a win for the computer and survive.
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/com
Martin Mueller wrote:
I
did not realize that his program, even with a large tree, would not be
able to recognize the seki. I knew of course that the original Mogo
playouts had this problem, but I thought all strong programs had
solved it by now...
Hello Erik,
seki in playouts is still an un
Gian-Carlo Pascutto wrote:
The *paper* about MTD(f) is extremely interesting because it shows
that many best-first algorithms can be rewritten as depth-first
algorithms.
It happened for SSS, it happened for proof-number search.
Who will make it happen for UCT?
Actually, there was a pape
Hi,
Anybody knows what is rz-74? It is playing very strong at 19x19, and it
looks like nothing I have seen before. Monte-Carlo with a lot of domain
knowledge, maybe. A very strong classical program converted to
Monte-Carlo would be my guess. Probably not MonteGNU. Handtalk? Go++?
Very intere
Don Dailey wrote:
I was curious about that too, who is rz-74? The name is perhaps a
clue. Is it at version 74?I haven't been watching the games, but
are you saying it behaves like a Monte Carlo program?
- Don
After watching more games, I am less impressed by its strength. It is
def
Magnus Persson wrote:
I looked at the last games played by rz-74, and it looks like a
MC-program given how how it plays in the opening (odd moves in the
center). I also doubt there are any traditional programs who can get
90% against gnugo on 19x19. Are there?
I agree that the winning rate a
Ian Osgood wrote:
I haven't been able to access the ICGA tournament site for over a
week. Anyone know anything about it?
Ian
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Sorry fo
Ian Osgood wrote:
I haven't been able to access the ICGA tournament site for over a
week. Anyone know anything about it?
Ian
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
The websi
Ian Osgood wrote:
Thanks! I see that KCC Paduk is no longer on the list of participants
for 2008. Have they withdrawn?
Ian
Their registration was rejected because of "past problems with [this]
program in other computer Go tournaments" (these are the words of David
Levy). The ICGA will ma
Jacques Basaldúa wrote:
But when self atari is avoided in the playouts, groups live in seki
and counting
dame points really fast is required.
You should not worry about that kind of speedup. Looking at neighbors
has a very small cost. Negligible in comparison to the playout.
Especially if
David Fotland wrote:
In late september there is a computer go contest in Taizhou, with cash
prizes. They might cancel this contest due to lack of participation, so if
you are thinking of going, please let them know today or tomorrow.
David
How many participants do they have ? In the last mess
Erik van der Werf wrote:
I already booked my flights; Steenvreter will only participate in the
official ICGA events.
Personally I think it is bad to have 3 competing tournaments so close
to each other. I must say that I'm quite puzzled by the behavior of
the local organizers in China. In my opi
No need of translation:
http://219.142.86.87/English/index.asp
This is the location, as indicated in the invitation e-mail:
http://maps.google.com/maps?q=%E5%8F%B0%E5%B7%9E&ie=UTF8&oe=utf-8&client=firefox-a&ll=24.846565,120.058594&spn=67.50517,125.683594&z=3
Rémi
Don Dailey wrote:
On Wed, 2008-08-27 at 14:56 -0700, Bob Hearn wrote:
The MoGo team has said that MoGo wins 62% of its games against a
baseline version when the processing power doubles. That's about
half
a stone (if you assume you can generalize to human opponents).
Yes, I believe
Don Dailey wrote:
I don't really believe the ELO model is "very wrong." I only believe
it is a mathematical model that is "somewhat" flawed for chess and
presumable also for other games. Do you have an alternative that might
be more accurate?
- Don
I don't have very precise data about
This was my post about multi-dimensional Elo:
http://www.mail-archive.com/computer-go@computer-go.org/msg06267.html
I have not tried it since that time.
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/li
[EMAIL PROTECTED] wrote:
Wasn't it today that Crazystone had a match against a professional
player? During the FIT2008 conference at Keio University?
Does anyone know the result and if the game is available somewhere?
Jonas
___
computer-go mailing lis
terry mcintyre wrote:
Congratulations!
Thanks.
I'm dying for details! What was the time limit?
The organizers asked that the program should play at a constant time (30
second) per move. The sgf file contains time stamps (you can see the
time with gogui, for instance). I don't know what
Don Dailey wrote:
I'm thinking that if we estimate Aoba at 10d amateur and CrazyStone wins
with 8 stone handicap, it is roughly equivalent to beating a 2d player
without handicap and that we can subtract 2 stones to say that with
pretty high confidence CrazyStone is playing at least 1 kyu (but t
Andy wrote:
I'm excited to see a computer reach 1d as well. For me I'm waiting to
see a bot hold a 1d rating consistently on kgs. Right now CrazyStone
has been rated 1d briefly, but hasn't been able to maintain it. It's
currently 1k.
I put a small table of the progress of a few bot's ratin
Nick Wedd wrote:
When mandelbrot resigns, saying "I was pwned", it appears to me that
he is ahead. If he plays at q11 instead of resigning, I think he can
kill Crazy Stone's s12 group - but it's difficult, and I'm not sure.
Bots are strong at psychological wins :-)
Rémi
__
Gian-Carlo Pascutto wrote:
Andy wrote:
Same thing for bots on KGS.
As far as I understand, GTP only supports canadian byo-yomi which is not
so popular. Leela should support it but I have never tried.
The problem is not GTP, but the KGS client. The time_left of kgsgtp does
not give
David Fotland wrote:
I made a change over the weekend, which looks like it makes 9x9 150 ELO
weaker and 19x19 over 200 ELO stronger.
Very strange.
David
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listi
David Fotland wrote:
Can you put crazystone back on 19x19 so I can see if it is just a fluke
against fuego?
I added locality to the light playouts - play near last or second to last
move, and some code to handle long ladders in playouts. I don’t think this
is anything unusual.
I think you h
Sihai Zhang wrote:
> Are there some good books for computer Go course? Thanks!
Hi,
I am not aware of a book that would cover modern go-programming
techniques (ie Monte-Carlo).
You'll find plenty of ressources in the Computer-go bibliography:
http://www.citeulike.org/group/5884/library
Maybe
Sihai Zhang wrote:
Hi all,
I am now seeking some good textbooks for computer-go course in my university
for undergraduates. I hope I can get some advice from this mailing list,
thank you all!
Best regards,
Jacky Zhang
USTC, China
___
computer-go ma
Ingo Althöfer wrote:
Hello all, two questions.
(i) Do there exist strong 9x9-go programs on Monte-Carlo base
for Japanese rules?
(ii) Having available only programs for Chinese rules, but playing
in a tournament with Japanese rules, which special tricks and
settings should be used to maximise w
Dave Dyer wrote:
At 01:52 AM 11/27/2008, Denis fidaali wrote:
...
But what really lacks (or i wasn't able to find anyway) is a strong community
like there is for go.
A CGOS equivalent.
A GTP equivalent.
A Gogui equivalent.
A Kgs equivalent.
I don't think there's a match between you
Ingo Althöfer wrote:
Concerning the next Computer Olympiad and having in mind
the discussion on the last one ("how fair is 7.5 komi for
9x9 computer games?") the WMSG scoring should be worth
to be discussed for 9x9.
Nobody will want such a scoring in computer go. It is not a matter of
addi
Darren Cook wrote:
I was reading a report on the UEC Cup [1] on a (Japanese) blog, and if I
understood correctly the results were:
1. Crazy stone
2. Fudogo (?) (Hideki Kato's program)
3. Many Faces
4. Katsunari
(Mogo had time trouble and pulled out?)
Crazy stone then played against Kaor
David Fotland wrote:
Congratulations to Remi for Crazystone's second UEC cup victory, and solid
win over a professional.
David
Thank you David.
For some reason, games between Crazy Stone and MFG are always
complicated and exciting. I watched a few when we were playing on CGOS,
and they we
jonas.k...@math.u-psud.fr wrote:
Although Tei and Aoba Professionals explained the match at the
front stage with a projection, the game was so complicated that I
couldn't see which is winning until near the end. Another semi-final
match, my Fudo Go vs Katsunari, also was shown on the screen but
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 particip
Ingo Althöfer wrote:
PS: Are there any gentlewomen programmers around in
computer go ?
Yumiko Suzuki participated in the First UEC Cup with Bell.
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/list
Ingo Althöfer wrote:
Question: Have nullmove-concepts been tried
or analysed in MCTS or UCT-settings?
Background of the question: Using alpha-beta tree
search, the (asymptotic) percentage of nullmove cutoffs
may help as an indicator for the "naturality" or
"interestingness" of a (newly invented
Gian-Carlo Pascutto wrote:
Rémi Coulom wrote:
Null-move pruning only make sense in alpha-beta. MCTS/UCT are more like
min-max. They do no alpha-beta pruning, so cannot do null-move pruning.
Null move works like this: if after passing and a small search the
position still looks good
Gian-Carlo Pascutto wrote:
Rémi Coulom wrote:
Did you manage to get something to work with null move ?
When Leela runs the first simulation in a node, it plays 2 moves for the
same side, then does a playout.
If the playout loses for the not-passing side, I add x lost games to the
Don Dailey wrote:
You are right, the d3p version rallied to come from behind and staged
an exciting and dramatic comeback:
Rank Name Elo+- games score oppo. draws
1 d3p 2016 77 7521 52% 20000%
2 base 2000 75 7721 48% 20160%
- Don
If you'd
Don Dailey wrote:
I'm not sure I understand - when you say N playouts, do you mean N
visits of that node? Because once you visit a node, you expand it, no
longer doing playouts from that point.
Yes, I mean N visits. In my view, every playout starts at the root.
For instance if e5 is pla
1 - 100 of 392 matches
Mail list logo
