Re: [computer-go] First ever win of a computer against a pro 9P as black (game of Go, 9x9).

dhillism...@netscape.net: <8cc28baed6fbe16-3fc0-16...@webmail-d068.sysops.aol.com>: >Hideki, > >Thank you. Your results look quite compelling. Do you allow memory (the number >of nodes in >the tree) to grow along with thinking time or is there a fixed limit? Each node of HA8000 cluster has 32

[computer-go] TAAI computer Go tournament in Taiwan

The tournament was held at October 30th at Chaoyang University of Technology in Taichung, Taiwan, with TAAI2009, the 14th Conference on Artificial Intelligence and Applications, http://taai2009.inf.cyut.edu.tw/ (in Chinese). Both 9x9 and 19x19 were played in one day with 5 round swiss. Each r

Re: [computer-go] First ever win of a computer against a pro 9P as black (game of Go, 9x9).

Hideki, Thank you. Your results look quite compelling. Do you allow memory (the number of nodes in the tree) to grow along with thinking time or is there a fixed limit? IIRC Don et. al.'s excellent scaling studies included gnugo but its effect was probably small. Self play dominated. Perhaps

Re: [computer-go] MPI vs Thread-safe

Darren Cook: <4aecdf3e.7010...@dcook.org>: > Parallelization *cannot* provide super-linear speed-up. >>>... >>> The result follows from a simulation argument. Suppose that you had a >>> parallel process that performed better than N times a serial program. >>> Construct a new serial program that

Re: [computer-go] MPI vs Thread-safe

Parallelization *cannot* provide super-linear speed-up. >>... >> The result follows from a simulation argument. Suppose that you had a >> parallel process that performed better than N times a serial program. >> Construct a new serial program that simulates the parallel process. There is >> a c

Re: [computer-go] MPI vs Thread-safe

On Fri, Oct 30, 2009 at 12:50 PM, Brian Sheppard wrote: >>> Parallelization *cannot* provide super-linear speed-up. >> >>I don't see that at all. > > This is standard computer science stuff, true of all parallel programs and > not just Go players. No parallel program can be better than N times a s

Re: [computer-go] Neural networks

Present day MC Go programs are neural networks. The playout is the trainng process. DL -Original Message- From: Petr Baudis To: computer-go@computer-go.org Sent: Wed, Oct 14, 2009 7:26 am Subject: [computer-go] Neural networks Hi! Is there some "high-level reason" hypothesised

Re: [computer-go] about the solution of Japanese Rule

xiefan wrote: Hi all, I heard that the UCE cup is set to use Japanese rule, which is quite different from Chinese rule when players play PASS. It is ok to play another pass after a pass, but it seems to be problem if two players all pass in the middle game. is there any better solution to th

RE: [computer-go] about the solution of Japanese Rule

I'm not sure what you are asking, but when you are playing with Japanese rules, don't pass in the middle game. The simple solution is to wait until the game is over and all dame are filled before you pass. From: computer-go-boun...@computer-go.org [mailto:computer-go-boun...@computer-go.org] O

[computer-go] about the solution of Japanese Rule

Hi all, I heard that the UCE cup is set to use Japanese rule, which is quite different from Chinese rule when players play PASS. It is ok to play another pass after a pass, but it seems to be problem if two players all pass in the middle game. is there any better solution to this problem?