Let this list, and all replies be a comprehensive list of websites and docs
publically availble concerning Go dev.
-Josh
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Some replies on my original mail indicate that I did not
make clear the motivation of my proposal.
You have to distinguish several scenarii when maximizing
the playing strength/value of your Go program:
(a) auto-play (or play between different versions of your prog)
(a') play against other
You have to distinguish several scenarii when maximizing
the playing strength/value of your Go program:
(a) auto-play (or play between different versions of your prog)
(a') play against other computer programs
(b) play against humans
(c) program as tool for human analysis of Go positions or
[computer-go] programming (languages) light-simulation contest
The reason i have been eager to make so sure my implementation was conform
to what i had in mind (this time ..) is that i wanted to be
Hi,
I put some photos in Beijing Computer Go tournament.
http://yssaya.web.fc2.com/photo/beijing2008/beijing2008.html
Regards,
Hiroshi Yamashita
___
computer-go mailing list
computer-go@computer-go.org
Hello Hiroshi,
thanks for the many nice photos from Beijing.
I have a few questions (indeed, I have many, but will ask
only a few of them):
* On which picture(s) can I find you?
* Is Feng Hsiung Hsu (guest of honor, when I understand correctly)
on some of your pictures?
* Is the programmer
Hi Ingo,
* On which picture(s) can I find you?
http://yssaya.web.fc2.com/photo/beijing2008/1002/Htmls/PICT2554.html
Left is me.
* Is Feng Hsiung Hsu (guest of honor, when I understand correctly)
No, I think he did not come.
* Is the programmer of HandTalk on some of the pictures?
No,
Thanks everyone for the answers regarding playout terminations. I still
have my suspicions regarding how artificial game length bounds affect
the position evaluation (I'd expect the values to fluctuate with length,
so arbitrary bounds would result in arbitrary differences).
For the moment,
Claus Reinke wrote:
...
Gobble: 'a' is not an eye = fill it and die
Olga: 'a' is an eye, but would cease to be if 'b' was white
Oleg: 'a' is not an eye, but would be if 'b' was black]
L[jj][hh][nk][oj]
GN[playout-eyes]
)
If I set this up correctly, the black center group is unconditionally
On Oct 10, 2008, at 2:10 PM, Stuart A. Yeates wrote:
On Sat, Oct 11, 2008 at 10:05 AM, terry mcintyre
[EMAIL PROTECTED] wrote:
I like the idea of a contest to determine the best ways to
implement a particular problem ( generating light playouts ) in
various languages.
The Language
There is a de facto standard light playout policy (algorithm). If you want to
adhere to this standard, then by definition, there are correct and incorrect
ways to do so. If you just want to design a better playout policy, naturally
anything is fair game. But how are you going to measure whether
On Oct 9, 2008, at 10:39 PM, Don Dailey wrote:
On Thu, 2008-10-09 at 15:20 -0400, [EMAIL PROTECTED] wrote:
Computers + random = can of worms.
What if I get a fast benchmark by implementing the fastest, most
awful, random number generator imaginable? What if every one of my
random playouts
Sure,
A lot faster is ranrot in 64 bits, at K8 2.2ghz with old GCC it is
about 3.3 ns for each number,
so i assume it's quite a tad faster than that for core2. Note it's
quite slow at itanium,
about 9-10 nanoseconds a number, as it appeared later itanium has no
rotate hardware instructions
13 matches
Mail list logo
