On Sun, Oct 25, 2009 at 10:16:58PM +0100, Folkert van Heusden wrote:
> > > What method are you guys using for the monte carlo search? What do you
> > > do?
> > > I pick at random a move, then for the resulting board that comes out of
> > > that pick another move and so on.
> > > Then, after that I evaulate the number of stones etc.
> >
> > Do you mean you count the score? Make sure you actually count the stone
> > right, and (quite important) that you are picking out moves really at
> > random, not skewed in any way.
>
> Yes, the score indeed. Well, only the number of stones removed from the
> board. I did not implement an algorithm to count areas belonging to a
> color yet.
That would seem to have only quite limited correlation with winning the
game.
> May I ask: how many board-settings (one move + all evaluation) do your
> programs calculate per second?
Depends on the hardware. ;-) We usually count in number of complete
playouts per second.
On 9x9, libego can play i think about 100k playouts per second on decent
CPU, but is very light. Pachi can do 35k light playouts per second and
15k heavy playouts per second on the same CPU (single-threaded). Both
Pachi and libego are written in a compiled language; when your speed is
in the right order of magnitude, I've found playout move selection
improvements much more profitable than further optimizing for speed.
--
Petr "Pasky" Baudis
A lot of people have my books on their bookshelves.
That's the problem, they need to read them. -- Don Knuth
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
