> If you're looking for spare processors, how about a "[EMAIL PROTECTED]"
> program for Go?-)
It appears that the Chess community has had such a project already:
ChessBrain: a Linux-Based Distributed Computing Experiment
http://www.linuxjournal.com/article/6929
ChessBrain II - A Hier
>From browsing Monte-Carlo Go papers (*), I get the impression that random
playouts are used mainly to approximate an evaluation function, determining
some value for board positions arising in more traditional tree search.
Is that correct? It seems somewhat wasteful to calculate all those poss
Does anyone have any information on the results of [the computer Go
aspects of] these events?
Cotsen go tournament 2008
September 20 & 21
http://www.cotsengotournament.com/ treats it as being in the future
Jiuding Cup
September 22-26
http://219.142.86.87/English/index.asp times out
World 9x
I agree with much of what you say (to the degree that anyone needs to "agree"
with questions).
The discussions on this list dealing with "ownership maps", RAVE and AMAF have
to do with using additional information from the playouts.
Playouts can't be "unbiased." Picking a move with uniform prob
Many Faces of Go participated in the main Cotsen tournament, playing against
people, on a 2 core machine, run by volunteer Terry McIntyre. It lost 3
times to 3 kyu, beat a 4 kyu, and beat a 5 kyu.
The Computer game Olympiad in Beijing is being played now. 9x9 results are
up after each round here
Nick Wedd: <[EMAIL PROTECTED]>:
>Does anyone have any information on the results of [the computer Go
>aspects of] these events?
>
>Cotsen go tournament 2008
>September 20 & 21
>http://www.cotsengotournament.com/ treats it as being in the future
>
>Jiuding Cup
>September 22-26
>http://219.142.86.
On Sep 28, 2008, at 7:05 AM, Claus Reinke wrote:
For instance, if an intersection belongs to the same colour in
all playouts,
chances are that it is fairly secure (that doesn't mean one
shouldn't play
there, sacrifices there may have an impact on other
intersections).
Or,
