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

2009-10-28 Thread Olivier Teytaud
> > > But is it shown that "the score is well done" for these properties to > hold in case of RAVE-guided exploration? Since it massively perpetuates > any kind of MC bias... > This only matters for the fact that we don't visit all the tree. For the consistency (the fact that asymptotically we wil

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

2009-10-28 Thread Olivier Teytaud
> > > >If there are people interested in a ph.D. or a post-doc around Monte-Carlo > >Tree Search, candidates are welcome (Monte-Carlo Tree Search, and not > >necessarily / not only computer-go). > > Excuse me, but what press conference and where to ask? > People interested in a ph.D. or a post doc

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

2009-10-28 Thread Hideki Kato
Mark Boon: <66913149-592c-426d-b52d-f52f3fa51...@gmail.com>: >On Oct 27, 2009, at 7:41 PM, Hideki Kato wrote: > >> IMHO, Jeff's idea is still very interesting while >> the implementation by the staff in Numenta have been going to not >> right direction. > >That was also my opinion. What I thought

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

2009-10-28 Thread Eric Boesch
Am I remembering correctly (maybe not) that Mogo communicates between nodes three times per second? That isn't a lot of communication opportunities if each turn lasts a few seconds. Olivier, have you tested parallel Mogo's ability to scale with core count at blitz speeds? I might imagine, for examp