[computer-go] GPW08 paper: Parallel MCTS

Hi, This is my GPW08 paper. Parallel Monte-Carlo Tree Search with Simulation Servers by Hideki Kato and Ikuo Takeuchi Abstract: Recently Monte-Carlo tree search is boosting the performance of computer Go playing programs. A novel parallel Monte-Carlo tree search algorithm is proposed. A tree s

[computer-go] Result of 2nd GPW Cup Computer Go Tournament in Hakone, Japan

Japanese version of the result of 2nd GPW Cup Computer Go Tournament is available at http://sig-gi.c.u-tokyo.ac.jp/gpw/2008/night.html#go-results English version follows. Ten programs from three countries were participated and we changed planed alternating BW round-robin to simple one. HappyG

[computer-go] Monte carlo play

Greetings all go gurus, I am new to programming go, could some one explain to me how a monte carlo based evalution manages to play random games by itself? ie: who/what is the oppoent which supplies the opposing moves which allows another move to be randomly played after making the initial move

Re: [computer-go] Monte carlo play

> I am new to programming go, could some one explain to me how a monte > carlo based evalution manages to play random games by itself? ie: > who/what is the oppoent which supplies the opposing moves which > allows another move to be randomly played after making the initial It is self-play, so both